BasicCodes/sorting.cpp at main · wallbreaker01/BasicCodes · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
#include<bits/stdc++.h>
typedef long long int ll;
using namespace std;
const ll N=100000;
ll s[N];

// void swap(ll arr[],ll i, ll j)
// {
//     ll temp=arr[i];
//     arr[i]=arr[j];
//     arr[j]=temp;
// }

void bubbleSort(ll arr[],ll n)
{
    for(ll i=0;i<n-1;i++)
    {
        for(ll j=0;j<n-1-i;j++)
        {
            if(arr[j]>arr[j+1]) swap(arr[j],arr[j+1]);
        }
    }
}

void selectionSort(ll arr[],ll n)
{
    for(ll i=0;i<n;i++)
    {
        ll mn=i;
        for(ll j=i+1;j<n;j++)
        {
            if(arr[j]<arr[mn]) mn=j;
        }
        swap(arr[i],arr[mn]);
    }
}

void insertionSort(ll arr[],ll n)
{
    ll key,j;
    for(ll i=1;i<n;i++)
    {
        key=arr[i];
        j=i-1; //i er bam er index
        while(j>=0 && arr[j]>key)
        {
            arr[j+1]=arr[j]; //bam er index daner che boro hole ek ghor kore dane sorai dibo
            j--; //
        }
        arr[j+1]=key; //current number k boshai dilam faka zaygay
    }
}

void merge(ll arr[], ll l, ll mid, ll r)
{
    ll n1=mid-l+1;
    ll n2=r-mid;
    ll a[n1];
    ll b[n2];

    for(ll i=0;i<n1;i++) a[i]=arr[l+i];
    for(ll i=0;i<n2;i++) b[i]=arr[mid+1+i];

    ll i=0,j=0,k=l;
    while(i<n1 && j<n2)
    {
        if(a[i]<b[j])
        {
            arr[k]=a[i];
            k++;
            i++;
        }
        else
        {
            arr[k]=b[j];
            k++;
            j++;
        }
    }

    while(i<n1)
    {
        arr[k]=a[i];
        k++;
        i++;
    }
    while(j<n2)
    {
        arr[k]=b[j];
        k++;
        j++;
    }

}
void mergeSort(ll arr[],ll l,ll r)
{
    if(l<r)
    {
        ll mid=(l+r)/2;
        mergeSort(arr,l,mid);
        mergeSort(arr,mid+1,r);
        merge(arr,l,mid,r);
    }
}

int partition(ll arr[],ll l, ll r)
{
    ll pivot=arr[r];
    ll i=l-1;
    for(ll j=l;j<r;j++)
    {
        if(arr[j]<pivot)
        {
            i++;
            swap(arr[i],arr[j]);
        }
    }
    swap(arr[i+1],arr[r]); //pivot ta r index theke i er porer index e niya ashchi
    return i+1;
}

void quickSort(ll arr[],ll l, ll r)
{
    if(l<r)
    {
        ll pi = partition(arr,l,r);
        quickSort(arr,l,pi-1);
        quickSort(arr,pi+1,r);
    }
}


int main()
{
    ll n;
    cin>>n;
    ll s[n];
    for(ll i=0;i<n;i++) cin>>s[i];
    //bubbleSort(s,n);
    //selectionSort(s,n);
    //insertionSort(s,n);
    //mergeSort(s,0,n);
    //quickSort(s,0,n-1);

    for(ll i=0;i<n;i++) cout<<s[i]<<" ";
}