blob: c373d959586f52cd7a4b7c4f36581252fb0d74d6 (
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
67
68
69
70
71
72
73
74
75
|
int arr[100];
int partition(int l, int r)
{
int i;
int j;
int tmp;
i = l + 1;
j = l;
while (i <= r)
{
if (arr[i] > arr[l])
{
i = i + 1;
}
else
{
tmp = arr[j + 1];
arr[j + 1] = arr[i];
arr[i] = tmp;
i = i + 1;
j = j + 1;
}
}
tmp = arr[j];
arr[j] = arr[l];
arr[l] = tmp;
return j;
}
void _quickSort(int l, int r)
{
int key;
if (l >= r)
{
return;
}
key = partition( l, r);
_quickSort( l, key - 1);
_quickSort( key + 1, r);
}
void quickSort(int n)
{
_quickSort(0, n - 1);
return;
}
void printArray(int n)
{
int i = 0;
while (i < n)
{
putint(arr[i]);
putch(32);
// printf("%d ", arr[i]);
i = i + 1;
}
}
int main()
{
int n;
int i = 0;
n = getint();
while (i < n)
{
arr[i] = getint();
i = i + 1;
}
quickSort(n);
printArray(n);
return 0;
}
|
