Data-Structure/Quick_sort.cpp at master · DeekshaKodieur/Data-Structure · 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
#include<iostream>

using namespace std;

int partition(int *a, int s , int e)
{
    int i=s-1;
    int j;
    int pivot=a[e];
    for(j=s ; j<e;j++)
    {
       if(a[j]<=pivot)
       {
           i++;
           swap(a[i],a[j]);
       }
    }

    swap(a[i+1],a[e]);
    return i+1;

}

void quick_sort(int *a,int s,int e)
{
    if(s>=e)
    {
        return;
    }
    int p=partition(a,s,e);  //for finding p
    quick_sort(a,s,p-1);
    quick_sort(a,p+1,e);

}


int main()
{
    int a[100],n;
    cout<<"Total number of elements :    " ;
    cin>>n;
    cout<<endl;
    cout<<"Enter the elements : " <<endl;
    for(int i=0;i<n;i++)
    {
        cin>>a[i];
    }
    cout<<endl;

    quick_sort(a,0,n-1);

    cout<<"Elements after quick sort : ";

    for(int i=0;i<n;i++)
    {

        cout<<a[i]<<" ";
    }
    cout<<endl;

return 0;
}