Sorting-Algorithms/QuickSort.cpp at master · bishworup11/Sorting-Algorithms · 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
#include<bits/stdc++.h>
using namespace std;

int partition(int arr[],int low,int hi)
{
    int pivot;
    int p=low;
    pivot=arr[hi];
    for(int i=low;i<hi;i++)
    {
        if(arr[i]<=pivot)
        {

            swap(arr[i],arr[p]);
            p++;
        }


    }
    swap(arr[p],arr[hi]);
    return p;

}

void QuickSort(int arr[],int low ,int hi )
{
    int pi;

    if(low<hi)
    {

        pi=partition(arr,low,hi);
       // cout<<pi<<" ";
        QuickSort(arr,low,pi-1);
        QuickSort(arr,pi+1,hi);

    }


}

void display(int arr[],int n)
{

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

        cout<<arr[i]<<" ";
    }
}

int main()
{
    int n;

    printf("input the array length\n");

    cin>>n;
    int ar[n];
    for(int i=0;i<n;i++)
    {

        cin>>ar[i];
    }
     QuickSort(ar,0,n-1);

    display(ar,n);


}