blob: f743e52b2e2b2811f4bbc3f5c74a59b8e9a9b729 (
plain)
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
59
60
61
62
63
64
65
66
|
int n;
int QuickSort(int arr[], int low, int high)
{
if (low < high)
{
int i;
i = low;
int j;
j = high;
int k;
k = arr[low];
while (i < j)
{
while(i < j && arr[j] > k - 1)
{
j = j - 1;
}
if(i < j)
{
arr[i] = arr[j];
i = i + 1;
}
while(i < j && arr[i] < k)
{
i = i + 1;
}
if(i < j)
{
arr[j] = arr[i];
j = j - 1;
}
}
arr[i] = k;
int tmp;
tmp = i - 1;
tmp = QuickSort(arr, low, tmp);
tmp = i + 1;
tmp = QuickSort(arr, tmp, high);
}
return 0;
}
int main(){
n = 10;
int a[10];
a[0]=4;a[1]=3;a[2]=9;a[3]=2;a[4]=0;
a[5]=1;a[6]=6;a[7]=5;a[8]=7;a[9]=8;
int i;
i = 0;
int tmp;
tmp = 9;
i = QuickSort(a, i, tmp);
while (i < n) {
int tmp;
tmp = a[i];
putint(tmp);
tmp = 10;
putch(tmp);
i = i + 1;
}
return 0;
}
|
