-
Notifications
You must be signed in to change notification settings - Fork 3
/
quicksort.c
46 lines (35 loc) · 1.02 KB
/
quicksort.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
#include <stdio.h>
void quickSort(int array[], int start, int end);
int partition(int array[], int start, int end);
int main() {
int array[] = {8, 2, 5, 3, 9, 4, 7, 6, 1};
int arraySize = sizeof(array) / sizeof(array[0]);
quickSort(array, 0, arraySize - 1);
for (int i = 0; i < arraySize; i++) {
printf("%d ", array[i]);
}
return 0;
}
void quickSort(int array[], int start, int end) {
if (end <= start) return; // base case
int pivot = partition(array, start, end);
quickSort(array, start, pivot - 1);
quickSort(array, pivot + 1, end);
}
int partition(int array[], int start, int end) {
int pivot = array[end];
int i = start - 1;
for (int j = start; j <= end; j++) {
if (array[j] < pivot) {
i++;
int temp = array[i];
array[i] = array[j];
array[j] = temp;
}
}
i++;
int temp = array[i];
array[i] = array[end];
array[end] = temp;
return i;
}