Algorithm/QuickSort.cpp at master · nowshad7/Algorithm · 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
#include<bits/stdc++.h>

using namespace std;

int partion(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 QuickSort(int A[], int s, int e)
{
    if(s<e)
    {
         int p=partion(A, s, e);
         QuickSort(A,s,p-1);
         QuickSort(A,p+1, e);
    }
}

int main ()
{
    int n;
    cin>>n;
    int A[n];
    for(int i=0;i<n;i++)
        A[i]=rand()%100;

    cout <<"Unsorted Array : ";
    for(int i=0;i<n;i++)
        cout<<A[i]<<" ";
    cout<<endl;

    QuickSort(A, 0 , n-1);

    cout <<"Sorted Array : ";
    for(int i=0;i<n;i++)
        cout<< A[i]<<" ";


}