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
|
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#include <schroedinger/schrofilter.h>
#include <schroedinger/schro.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
void
sort_u8 (uint8_t *d, int n)
{
int start = 0;
int end = n;
int i;
int x;
/* OMG bubble sort! */
while(start < end) {
for(i=start;i<end-1;i++){
if (d[i] > d[i+1]) {
x = d[i];
d[i] = d[i+1];
d[i+1] = x;
}
}
end--;
for(i=end-2;i>=start;i--){
if (d[i] > d[i+1]) {
x = d[i];
d[i] = d[i+1];
d[i+1] = x;
}
}
start++;
}
}
#define N 9
int
main (int argc, char *argv[])
{
int i;
int j;
uint8_t list[N];
int sum1, sum2;
srand(time(NULL));
for (i=0;i<100;i++){
SCHRO_ERROR("%d:", i);
sum1 = 0;
for(j=0;j<N;j++){
list[j]=rand();
SCHRO_ERROR(" %d", list[j]);
sum1 += list[j];
}
sort_u8 (list, N);
sum2 = 0;
for(j=0;j<N;j++){
SCHRO_ERROR("* %d", list[j]);
sum2 += list[j];
}
SCHRO_ASSERT(sum1 == sum2);
for(j=0;j<N-1;j++){
SCHRO_ASSERT(list[j] <= list[j+1]);
}
}
return 0;
}
|
