-
Notifications
You must be signed in to change notification settings - Fork 0
/
3_ArrayTest.cpp
37 lines (31 loc) · 954 Bytes
/
3_ArrayTest.cpp
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
#include <ctime>
#include <iostream>
#include <array>
#include <cstdlib>
#include "stlutil.h"
using namespace std;
void test_array() {
cout << "\ntest_array().......\n";
array<long, ASIZE> c;
clock_t timeStart = clock();
for (int i=0; i<ASIZE; ++i)
c[i] = rand();
cout << "milli-seconds: " << clock() - timeStart << endl;
cout << "array.size()" << c.size() << endl;
cout << "array.front()" << c.front() << endl;
cout << "array.back()" << c.back() << endl;
cout << "array.data()" << c.data() << endl;
long target = get_a_target_long();
timeStart = clock();
qsort(c.data(), ASIZE, sizeof(long), compareLong);
long* pItem = (long*)bsearch(&target, (c.data()), ASIZE, sizeof(long), compareLong);
cout << "qsort()+bsearch(), milli-seconds: " << clock() - timeStart << endl;
if (pItem!=nullptr)
cout << "found " << *pItem << endl;
else
cout << "not found!" << endl;
}
int main() {
test_array();
return 0;
}