-
Notifications
You must be signed in to change notification settings - Fork 0
/
enumeration.c
62 lines (49 loc) · 1.11 KB
/
enumeration.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
#include <stdio.h>
#include <time.h>
#include <stdlib.h>
/*******************************************************************************
* ALGORITHM 1 -- ENUMERATION
******************************************************************************/
int randnum() {
int num, pos;
num = rand() % 100;
pos = rand() % 2;
if(pos == 1) {
num = num * -1;
}
return num;
}
int main() {
int sum, maxsum, i, j, k, m;
int* a;
clock_t begin, end;
double time_spent;
int n[9] = {100, 200, 300, 400, 500, 600, 700, 800, 900};
srand(time(NULL));
sum = 0;
maxsum = 0;
for(m=0; m<9; m++) {
a = malloc(sizeof(int)*n[m]);
for(i=0; i<n[m]; i++) {
a[i] = randnum();
//printf("%d ", a[i]);
}
//printf("\n");
begin = clock();
for(i=0; i<(n[m]-1); i++) {
for(j=1; j<n[m]; j++) {
sum = 0;
for(k=i; k<(j+1); k++) {
sum += a[k];
}
if(sum > maxsum) {
maxsum = sum;
}
}
}
end = clock();
time_spent = (double)(end - begin) / CLOCKS_PER_SEC;
printf("time spent: %f\n", time_spent);
}
return 0;
}