-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathYarkoTest.cpp
More file actions
145 lines (120 loc) · 5.08 KB
/
Copy pathYarkoTest.cpp
File metadata and controls
145 lines (120 loc) · 5.08 KB
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
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
// YarkoTest.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include <assert.h>
#include <time.h>
#include "Search1.h"
#include "Search2.h"
#include "Search3.h"
#include "Search4.h"
#include "Search5.h"
#include "SearchSasha.h"
int _tmain(int argc, _TCHAR* argv[])
{
int index = -1;/*
int test1[] = {0, 2, 4, 6, 8};
int test2[] = {8, 6, 4, 2, 0};
assert(Search5(test1, sizeof(test1)/sizeof(test1[0]), 1, -1, LessThanEquals, &index) == NotFound);
assert(Search5(test1, sizeof(test1)/sizeof(test1[0]), 1, 0, LessThan, &index) == NotFound);
assert(Search5(test1, sizeof(test1)/sizeof(test1[0]), 1, 0, Equals, &index) == FoundExact && index == 0);
assert(Search5(test1, sizeof(test1)/sizeof(test1[0]), 1, 1, Equals, &index) == NotFound);
assert(Search5(test1, sizeof(test1)/sizeof(test1[0]), 1, 2, GreaterThanEquals, &index) == FoundExact && index == 1);
assert(Search5(test1, sizeof(test1)/sizeof(test1[0]), 1, 2, GreaterThan, &index) == FoundGreater && index == 2);
assert(Search5(test2, sizeof(test2)/sizeof(test2[0]), 0, -1, LessThan, &index) == NotFound);
assert(Search5(test2, sizeof(test2)/sizeof(test2[0]), 0, 4, LessThanEquals, &index) == FoundExact && index == 2);
assert(Search5(test2, sizeof(test2)/sizeof(test2[0]), 0, 8, Equals, &index) == FoundExact && index == 0);
assert(Search5(test2, sizeof(test2)/sizeof(test2[0]), 0, 5, GreaterThanEquals, &index) == FoundGreater && index == 1);
assert(Search5(test2, sizeof(test2)/sizeof(test2[0]), 0, 2, GreaterThanEquals, &index) == FoundExact && index == 3);
assert(Search5(test2, sizeof(test2)/sizeof(test2[0]), 0, 9, GreaterThan, &index) == NotFound);
*/
const int cnCount = 100000000;
int* test3 = new int[cnCount];
for (int i=0; i<cnCount; i++)
test3[i] = i;
clock_t t, tsum = 0;
const int cnIter = 1;
printf ("\n<<< GreaterThan >>>\n");
for (int i=0; i<cnIter; i++)
{
t = clock();
Search1(test3, cnCount, 1, 50000000, GreaterThan, &index);
// Search1(test3, cnCount, 1, 50000000, GreaterThanEquals, &index);
// Search1(test3, cnCount, 1, 50000000, LessThan, &index);
t = clock() - t;
tsum += t;
printf ("Search1 took %d clicks (%f seconds).\n",t,((float)t)/CLOCKS_PER_SEC);
t = clock();
Search2(test3, cnCount, 1, 50000000, GreaterThan, &index);
// Search2(test3, cnCount, 1, 50000000, GreaterThanEquals, &index);
// Search2(test3, cnCount, 1, 50000000, LessThan, &index);
t = clock() - t;
tsum += t;
printf ("Search2 took %d clicks (%f seconds).\n",t,((float)t)/CLOCKS_PER_SEC);
t = clock();
Search3(test3, cnCount, 1, 50000000, GreaterThan, &index);
// Search3(test3, cnCount, 1, 50000000, GreaterThanEquals, &index);
// Search3(test3, cnCount, 1, 50000000, LessThan, &index);
t = clock() - t;
tsum += t;
printf ("Search3 took %d clicks (%f seconds).\n",t,((float)t)/CLOCKS_PER_SEC);
t = clock();
Search4(test3, cnCount, 1, 50000000, GreaterThan, &index);
// Search4(test3, cnCount, 1, 50000000, GreaterThanEquals, &index);
// Search4(test3, cnCount, 1, 50000000, LessThan, &index);
t = clock() - t;
tsum += t;
printf ("Search4 took %d clicks (%f seconds).\n",t,((float)t)/CLOCKS_PER_SEC);
t = clock();
Search5(test3, cnCount, 1, 50000000, GreaterThan, &index);
// Search5(test3, cnCount, 1, 50000000, GreaterThanEquals, &index);
// Search5(test3, cnCount, 1, 50000000, LessThan, &index);
t = clock() - t;
tsum += t;
printf ("Search5 took %d clicks (%f seconds).\n",t,((float)t)/CLOCKS_PER_SEC);
t = clock();
Search6(test3, cnCount, 1, 50000000, GreaterThan, &index);
// Search6(test3, cnCount, 1, 50000000, GreaterThanEquals, &index);
// Search6(test3, cnCount, 1, 50000000, LessThan, &index);
t = clock() - t;
tsum += t;
printf ("SearchSasha took %d clicks (%f seconds).\n",t,((float)t)/CLOCKS_PER_SEC);
}
printf ("\n<<< Equals >>>\n");
for (int i=0; i<cnIter; i++)
{
t = clock();
Search1(test3, cnCount, 1, 50000000, Equals, &index);
t = clock() - t;
tsum += t;
printf ("Search1 took %d clicks (%f seconds).\n",t,((float)t)/CLOCKS_PER_SEC);
t = clock();
Search2(test3, cnCount, 1, 50000000, Equals, &index);
t = clock() - t;
tsum += t;
printf ("Search2 took %d clicks (%f seconds).\n",t,((float)t)/CLOCKS_PER_SEC);
t = clock();
Search3(test3, cnCount, 1, 50000000, Equals, &index);
t = clock() - t;
tsum += t;
printf ("Search3 took %d clicks (%f seconds).\n",t,((float)t)/CLOCKS_PER_SEC);
t = clock();
Search4(test3, cnCount, 1, 50000000, Equals, &index);
t = clock() - t;
tsum += t;
printf ("Search4 took %d clicks (%f seconds).\n",t,((float)t)/CLOCKS_PER_SEC);
t = clock();
Search5(test3, cnCount, 1, 50000000, Equals, &index);
t = clock() - t;
tsum += t;
printf ("Search5 took %d clicks (%f seconds).\n",t,((float)t)/CLOCKS_PER_SEC);
t = clock();
Search6(test3, cnCount, 1, 50000000, Equals, &index);
t = clock() - t;
tsum += t;
printf ("SearchSasha took %d clicks (%f seconds).\n",t,((float)t)/CLOCKS_PER_SEC);
}
delete[] test3;
// printf ("Average for %d iterations is %f clicks (%f seconds).\n",cnIter, (float)tsum/cnIter, ((float)tsum/cnIter)/CLOCKS_PER_SEC);
printf("\nOK\n");
return 0;
}