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
|
#include <time.h>
#include <stdlib.h>
#include <stdio.h>
#include <stc/crandom.h>
#ifdef __cplusplus
#include <algorithm>
typedef long long csort_elm_value;
#else
#define i_tag elm
#define i_val long long
#include <stc/algo/csort.h>
#endif
#define fmt_Elem "%lld"
int testsort(csort_elm_value *a, long size, const char *desc) {
clock_t t = clock();
#ifdef __cplusplus
printf("std::sort: ");
std::sort(a, a + size);
#else
printf("csort: ");
csort_elm(a, size);
#endif
t = clock() - t;
printf("%s: %d elements sorted in %.2f ms\n",
desc, (int)size, (float)t*1000.0f/CLOCKS_PER_SEC);
return 0;
}
int main(int argc, char *argv[]) {
long i, size = argc > 1 ? strtol(argv[1], NULL, 0) : 10000000;
csort_elm_value *a = (csort_elm_value*)c_malloc(c_sizeof(*a) * size);
if (a == NULL) return -1;
for (i = 0; i < size; i++)
a[i] = crandom() & ((1U << 28) - 1);
testsort(a, size, "random");
for (i = 0; i < 20; i++)
printf(" " fmt_Elem, a[i]);
puts("");
for (i = 1; i < size; i++)
if (a[i - 1] > a[i]) return -1;
testsort(a, size, "sorted");
for (i = 0; i < size; i++) a[i] = size - i;
testsort(a, size, "reverse sorted");
for (i = 0; i < size; i++) a[i] = 126735;
testsort(a, size, "constant");
for (i = 0; i < size; i++) a[i] = i + 1;
a[size - 1] = 0;
testsort(a, size, "rotated");
for (i = 0; i < size; i++) a[i] = i % (size / 8);
testsort(a, size, "repeated");
free(a);
}
|
