-
Notifications
You must be signed in to change notification settings - Fork 1
/
sort.c
52 lines (49 loc) · 1.37 KB
/
sort.c
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
49
50
51
52
#include <assert.h>
#include <stdio.h>
void print_array(int* arr, int size)
{
int i;
int last = size - 1;
for (i = 0; i < last; i++) {
printf("%d, ", arr[i]);
}
printf("%d\n", arr[last]);
}
void quicksort(int *start, int size)
{
if (size <= 1) {
return;
}
int pivot = *start;
int less_than = 0;
int i;
for (i = 0; i < size; i++) {
if (start[i] < pivot) {
less_than++;
}
}
int swap = start[less_than];
start[less_than] = pivot;
*start = swap;
int j;
int swap_me = less_than;
/* find all elts in right half greater than pivot,
swap them into the left half. */
for (j = 0; j < less_than; j++) {
if(start[j] >= pivot) {
while (start[++swap_me] >= pivot)
;
assert(swap_me <= size);
swap = start[swap_me];
start[swap_me] = start[j];
start[j] = swap;
}
}
quicksort(start, less_than);
quicksort(start + less_than + 1, size - less_than - 1);
}
int main() {
int arr[5] = { 2, 3, 1, 4, 0 };
quicksort(arr, 5);
print_array(arr, 5);
}