C-plus-plus-codes/quick_sort.cpp at main · Aayush501/C-plus-plus-codes · 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
#include <iostream>
using namespace std;

void sortAlgo(int arr[], int p, int l, int r)
{
    if(l>r)
    {
        return;
    }
    int s1=r, s2=l, s3=r;
    while(l<=r)
    {
        if(arr[r]>=arr[p])
        {
            r--;
        }
        if(arr[l]<=arr[p])
        {
            l++;
        }
        if(s1==r and s2==l)
        {
            arr[r] = arr[r]^arr[l];
            arr[l] = arr[r]^arr[l];
            arr[r] = arr[r]^arr[l];
        }
        else
        {
            s1=r;
            s2=l;
        }
    }
    arr[r] = arr[r]^arr[p];
    arr[p] = arr[r]^arr[p];
    arr[r] = arr[r]^arr[p];

    sortAlgo(arr, p, p+1, r-1);
    sortAlgo(arr, l, l+1, s3);
}

void quickSort(int arr[], int n)
{
    int p=0, l=1, r=n-1;
    sortAlgo(arr, p, l, r);
}

int main()
{
    cout<<endl<<endl;
    int a[9] = {9,5,7,10,12,8,4,6,2};
    cout<<"array before sorting : ";
    for(int i=0; i<9; i++)
    {
        cout<<a[i]<<" ";
    }
    cout<<endl<<endl;
    quickSort(a, 9);
    cout<<"array after sorting : ";
    for(int i=0; i<9; i++)
    {
        cout<<a[i]<<" ";
    }
    cout<<endl<<endl;

    return 0;
}