-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathquickSort.cpp
More file actions
40 lines (36 loc) · 705 Bytes
/
Copy pathquickSort.cpp
File metadata and controls
40 lines (36 loc) · 705 Bytes
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
#include <iostream>
using namespace std;
void swap(int arr[], int i, int j){
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
int partition(int arr[], int l, int r){
int pivot = arr[r];
int i = l-1;
for(int j=l;j<r;j++){
if(arr[j] < pivot){
i++;
swap(arr,i,j);
}
}
swap(arr,i+1,r);
return i+1;
}
void quickSort(int arr[], int l, int r)
{
if(l<r){
int pi = partition(arr,l,r);
quickSort(arr,l,pi-1);
quickSort(arr,pi+1,r);
}
}
int main(){
int arr[5] = {5,4,3,2,1};
quickSort(arr,0,4);
for(int i=0; i<5;i++){
cout << arr[i] << " ";
}
cout << endl;
return 0;
}