-
Notifications
You must be signed in to change notification settings - Fork 4
/
7、quickSort.c
58 lines (48 loc) · 1.02 KB
/
7、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
47
48
49
50
51
52
53
54
55
56
57
58
/*
快速排序,时间复杂度:平均 O(nlogn),最坏O(n^2)
*/
#include<stdio.h>
int oneQuickSort(int *a, int i, int j);
void quickSort(int *a, int i, int j);
void showArray(int *a, int count);
void showArray(int *a, int count){
int i;
for(i = 0; i < count; i++){
printf("%d ", a[i]);
}
printf("\n");
}
void quickSort(int *a, int i, int j){
int index;
if(i < j){
index = oneQuickSort(a, i, j);
quickSort(a, i, index-1);
quickSort(a, index+1, j);
}
}
int oneQuickSort(int *a, int i, int j){
int tmp;
tmp = a[i];
while(i < j){
while(i < j && a[j] > tmp){
j--;
}
if(i < j){
a[i++] = a[j];
}
while(i < j && a[i] < tmp){
i++;
}
if(i < j){
a[j--] = a[i];
}
}
a[i] = tmp;
return i;
}
void main(void){
int a[] = {3, 7, 1, 0, 9, -9,};
int count = sizeof(a)/sizeof(int);
quickSort(a, 0, count-1);
showArray(a, count);
}