-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.cpp
67 lines (55 loc) · 1.44 KB
/
main.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
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
#include <iostream>
#include <vector>
#include <algorithm>
#include <thread>
#include <cstdlib>
#include <ctime>
#include <chrono>
//fdlkmslmfkslkmf
std::vector<int> generateVec(int size) {
std::vector<int> v(size);
for (int i = 0; i < size; ++i) {
v[i] = std::rand()%10000;
}
return v;
}
void sortVec(std::vector<int>& v) {
int i, j, key;
for (i = 1; i < v.size(); ++i) {
key = v[i];
j = i-1;
while(j >= 0 && v[j] > key) {
v[j+1] = v[j];
j = j-1;
}
v[j+1] = key;
}
}
int main() {
const int vectorSize = 6;
int size = 160000;
auto start = std::chrono::high_resolution_clock::now();
std::vector<int> vec1 = generateVec(size);
std::vector<int> vec2 = generateVec(size);
std::vector<int> vec3 = generateVec(size);
std::vector<int> vec4 = generateVec(size);
std::vector<int> vec5 = generateVec(size);
std::vector<int> vec6 = generateVec(size);
std::thread t1(sortVec, std::ref(vec1));
std::thread t2(sortVec, std::ref(vec2));
std::thread t3(sortVec, std::ref(vec3));
std::thread t4(sortVec, std::ref(vec4));
std::thread t5(sortVec, std::ref(vec5));
std::thread t6(sortVec, std::ref(vec6));
t1.join();
t2.join();
t3.join();
t4.join();
t5.join();
t6.join();
auto end = std::chrono::high_resolution_clock::now();
std::chrono::duration<double> duration = end - start;
std::cout << "Total Execution Time: " << duration.count() << " seconds." << std::endl;
std::cout << "Arr size is " << size << '\n';
return 0;
}