-
Notifications
You must be signed in to change notification settings - Fork 0
/
QuickSort.cpp
48 lines (39 loc) · 990 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
48
#include <iostream>
using namespace std;
template <class H> void quickSort(H arr[], int left, int right) {
int i = left, j = right;
int tmp;
H pivot = arr[(left + right) / 2];
/* partition */
while (i < j) {
while (arr[i] < pivot)
i++;
while (arr[j] > pivot)
j--;
if (i <= j) {
tmp = arr[i];
arr[i] = arr[j];
arr[j] = tmp;
i++;
j--;
}
};
/* recursion */
if (left < j)
quickSort(arr, left, j);
if (i < right)
quickSort(arr, i, right);
}
int main(){
int A[]={7,9,1,2,8,4,10,3,5,12,15,11,23,6};
int size=sizeof(A)/sizeof(A[0]);
for(int i=0; i<size; i++){
cout<<A[i]<<" ";
}
cout<<endl;
quickSort(A, 0, size-1);
for(int i=0; i<size; i++){
cout<<A[i]<<" ";
}
cout<<endl;
}