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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
|
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <time.h>
#include "ksort.h"
KSORT_INIT_GENERIC(int)
int main(int argc, char *argv[])
{
int i, N = 10000000;
int *array, x;
clock_t t1, t2;
if (argc > 1) N = atoi(argv[1]);
array = (int*)malloc(sizeof(int) * N);
srand48(11);
for (i = 0; i < N; ++i) array[i] = (int)lrand48();
t1 = clock();
x = ks_ksmall(int, N, array, 10500);
t2 = clock();
fprintf(stderr, "ksmall [%d]: %.3lf\n", x, (double)(t2-t1)/CLOCKS_PER_SEC);
srand48(11);
for (i = 0; i < N; ++i) array[i] = (int)lrand48();
t1 = clock();
ks_introsort(int, N, array);
t2 = clock();
fprintf(stderr, "introsort [%d]: %.3lf\n", array[10500], (double)(t2-t1)/CLOCKS_PER_SEC);
for (i = 0; i < N-1; ++i) {
if (array[i] > array[i+1]) {
fprintf(stderr, "Bug in introsort!\n");
exit(1);
}
}
#ifndef _ALIGNED_ONLY
{ // test unaligned ksmall
srand48(11);
unsigned char *a;
int *b;
a = malloc(N * sizeof(int) + 1);
b = (int*)(a + 1);
for (i = 0; i < N; ++i) b[i] = (int)lrand48();
t1 = clock();
ks_introsort(int, N, b);
t2 = clock();
fprintf(stderr, "introsort [%d]: %.3lf (unaligned: 0x%lx) \n", b[10500], (double)(t2-t1)/CLOCKS_PER_SEC, (size_t)b);
}
#endif
t1 = clock();
ks_introsort(int, N, array);
t2 = clock();
fprintf(stderr, "introsort (sorted): %.3lf\n", (double)(t2-t1)/CLOCKS_PER_SEC);
srand48(11);
for (i = 0; i < N; ++i) array[i] = (int)lrand48();
t1 = clock();
ks_combsort(int, N, array);
t2 = clock();
fprintf(stderr, "combsort: %.3lf\n", (double)(t2-t1)/CLOCKS_PER_SEC);
for (i = 0; i < N-1; ++i) {
if (array[i] > array[i+1]) {
fprintf(stderr, "Bug in combsort!\n");
exit(1);
}
}
srand48(11);
for (i = 0; i < N; ++i) array[i] = (int)lrand48();
t1 = clock();
ks_mergesort(int, N, array, 0);
t2 = clock();
fprintf(stderr, "mergesort: %.3lf\n", (double)(t2-t1)/CLOCKS_PER_SEC);
for (i = 0; i < N-1; ++i) {
if (array[i] > array[i+1]) {
fprintf(stderr, "Bug in mergesort!\n");
exit(1);
}
}
t1 = clock();
ks_mergesort(int, N, array, 0);
t2 = clock();
fprintf(stderr, "mergesort (sorted): %.3lf\n", (double)(t2-t1)/CLOCKS_PER_SEC);
srand48(11);
for (i = 0; i < N; ++i) array[i] = (int)lrand48();
t1 = clock();
ks_heapmake(int, N, array);
ks_heapsort(int, N, array);
t2 = clock();
fprintf(stderr, "heapsort: %.3lf\n", (double)(t2-t1)/CLOCKS_PER_SEC);
for (i = 0; i < N-1; ++i) {
if (array[i] > array[i+1]) {
fprintf(stderr, "Bug in heapsort!\n");
exit(1);
}
}
free(array);
return 0;
}
|
