 Code
1 quickSort(A, p, r)
2 {
3 if(p<r)
4 {
5 x = A[r];
6 i = p-1;
7 for j=p to r-1
8 {
9 if(A[j]<=x)
10 {
11 i++;
12 exchange A[i], A[j];
13 }
14 }
15 exchange A[i+1], A[r];
16
17 q = i+1;
18
19 quickSort(A, p, q-1);
20 quickSort(A, q+1, r);
21 }
22 }
|