-
Notifications
You must be signed in to change notification settings - Fork 9
/
quicksort.cpp
47 lines (45 loc) · 864 Bytes
/
quicksort.cpp
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
#include<bits/stdc++.h>
#include<vector>
using namespace std;
int partition(vector<int>& a, int p,int r) {
int x = a[p];
int l=p+1;
for(r; r >= l; r--) {
if(a[r] <= x) {
swap(a[r],a[p]);
p=r;
for(l; l<=r; l++) {
if(a[l] >= x) {
swap(a[l],a[p]);
p=l;
break;
}
}
}
}
return p;
}
void quickSort(vector<int> &a, int p, int r)
{
if(p==r || p>r){
return;
}
int q = partition(a, p, r);
quickSort (a,p,q-1);
quickSort (a,q+1,r);
}
int main()
{
int n;
cin>>n;
vector<int>arr(n);
for(int i=0; i<n; i++) {
cin>>arr[i];
}
quickSort(arr,0,n-1);
for(int j=0; j<n; j++) {
cout<<arr[j]<<" ";
}
cout<<endl;
return 0;
}