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
|
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
void quicksort(int lo, int hi, int base[])
{
int i,j;
int pivot,temp;
if (lo<hi) {
for (i=lo,j=hi,pivot=base[hi];i<j;) {
while (i<hi && base[i]<=pivot) i++;
while (j>lo && base[j]>=pivot) j--;
if (i<j) { temp=base[i]; base[i]=base[j]; base[j]=temp; }
}
temp=base[i]; base[i]=base[hi]; base[hi]=temp;
quicksort(lo,i-1,base); quicksort(i+1,hi,base);
}
}
int cmpint(const void * i, const void * j)
{
int vi = *((int *) i);
int vj = *((int *) j);
if (vi == vj) return 0;
if (vi < vj) return -1;
return 1;
}
int main(int argc, char ** argv)
{
int n, i;
int * a, * b;
int bench = 0;
if (argc >= 2) n = atoi(argv[1]); else n = 1000000;
if (argc >= 3) bench = 1;
a = malloc(n * sizeof(int));
b = malloc(n * sizeof(int));
for (i = 0; i < n; i++) b[i] = a[i] = rand() & 0xFFFF;
quicksort(0, n - 1, a);
if (!bench) {
qsort(b, n, sizeof(int), cmpint);
for (i = 0; i < n; i++) {
if (a[i] != b[i]) { printf("Bug!\n"); return 2; }
}
printf("OK\n");
}
return 0;
}
|
