SORTING/quick.cpp at main · Tripti445/SORTING · 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 quicksort(int a[],int low,int high)
{
   int pivot=a[high];
   int i=(low-1);

   for(int j=low;j<=high-1;j++)
   {
       if(a[j]<=pivot)
       {

           i++;
           swap(a[i],a[j]);

       }


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

void quick(int a[],int low,int high)
{
    if(low<high)
    {
        int pivot=quicksort(a,low,high);

        quick(a,low,pivot-1);
        quick(a,pivot+1,high);
    }
}

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

     quick(a,0,n-1);

    for(int i=0;i<n;i++)
    {
        cout<<a[i]<<" ";
    }
    return 0;
}