-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathfrog_jumps.c
76 lines (59 loc) · 1.45 KB
/
frog_jumps.c
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
// gcc frog_jumps.c -o frog_jumps.elf -Wall && ./frog_jumps.elf > frog_jumps.out.csv
#include <stdio.h>
#include <time.h>
#include <stdlib.h>
void print_array(double *data, long size) {
long i;
for(i=0;i<size;i++){
printf("%6.3f ",data[i]);
}
printf("\n");
}
void compare_summarization() {
double *data;
long i,count,step;
double sum;
for (count = 2; count < (long)1000*1000*1000*10; count*=2) {
printf("%ld\t", count);
data = malloc( sizeof(*data) * count );
fprintf( stderr, "count: %ld, memory: %lu byte\n", count, sizeof(*data) * count);
for(i=0;i<count;i++){
data[i] = (double) rand() / RAND_MAX;
}
sum = 0;
for(i=0;i<count;i++){
sum += data[i];
}
printf("%.15f\t", sum);
for (step = 1; step < count; step*=2) {
//print_array(data, count);
for ( i = 0; i+step < count; i+=2*step) {
//printf("%2ld %2ld: %f + %f\n", i, i+step, data[i] , data[i+step]);
data[i] += data[i+step];
//data[i+step] = 0;
}
}
//print_array(data, count);
printf("%.15f\t", data[0]);
printf("%.15f\n", data[0] - sum);
free(data);
}
}
void precision_test() {
long i, count = (long)1000*1000*1000*10;
double sum = 0;
for(i=0;i<count;i++){
sum += (double) rand() / RAND_MAX;
if ( i%(count/100) == 0) {
printf("%f\n", sum);
fprintf( stderr, " %ld ", 100*i/count);
}
}
printf("sum: %f\n", sum);
}
int main(void) {
srand(time(NULL));
compare_summarization();
//precision_test();
return 0;
}