| 1 |
#include <stdio.h> |
| 2 |
|
| 3 |
#define ARR_LEN 7 |
| 4 |
|
| 5 |
void qsort(int v[], int left, int right); |
| 6 |
void printArr(int v[], int len); |
| 7 |
|
| 8 |
int main() |
| 9 |
{ |
| 10 |
int i; |
| 11 |
int v[ARR_LEN] = { 4, 3, 1, 7, 9, 6, 2 }; |
| 12 |
printArr(v, ARR_LEN); |
| 13 |
qsort(v, 0, ARR_LEN-1); |
| 14 |
printArr(v, ARR_LEN); |
| 15 |
return 0; |
| 16 |
} |
| 17 |
|
| 18 |
void qsort(int v[], int left, int right) |
| 19 |
{ |
| 20 |
int i, last; |
| 21 |
void swap(int v[], int i, int j); |
| 22 |
|
| 23 |
if (left >= right) |
| 24 |
return; |
| 25 |
swap(v, left, (left + right) / 2); |
| 26 |
last = left; |
| 27 |
for (i = left+1; i <= right; i++) |
| 28 |
if (v[i] < v[left]) |
| 29 |
swap(v, ++last, i); |
| 30 |
swap(v, left, last); |
| 31 |
qsort(v, left, last-1); |
| 32 |
qsort(v, last+1, right); |
| 33 |
} |
| 34 |
|
| 35 |
void swap(int v[], int i, int j) |
| 36 |
{ |
| 37 |
int temp; |
| 38 |
|
| 39 |
temp = v[i]; |
| 40 |
v[i] = v[j]; |
| 41 |
v[j] = temp; |
| 42 |
} |
| 43 |
|
| 44 |
void printArr(int v[], int len) |
| 45 |
{ |
| 46 |
int i; |
| 47 |
for (i = 0; i < len; i++) |
| 48 |
printf("%d ", v[i]); |
| 49 |
printf("\n"); |
| 50 |
} |
| 51 |
|
| 52 |
// From https://github.com/Heatwave/The-C-Programming-Language-2nd-Edition/blob/master/chapter-4-functions-and-program-structure/8.qsort.c |
