-
Notifications
You must be signed in to change notification settings - Fork 8
/
Copy pathmain.cpp
88 lines (71 loc) · 2.27 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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
#include <ctime>
#include <vector>
#include <iostream>
#include <algorithm>
void merge(std::vector<int>& arr, size_t left, size_t mid, size_t right) {
std::vector<int> aux(right - left + 1);
// copy arr[left:right] to aux[]
// for (size_t i = left; i <= right; ++ i)
// aux[i - left] = arr[i];
std::copy_n(arr.begin() + left, right - left + 1, aux.begin());
size_t l = left, r = mid + 1;
for (size_t i = left; i <= right; ++ i) {
if (l > mid) {
arr[i] = aux[r - left];
++ r;
} else if (r > right) {
arr[i] = aux[l - left];
++ l;
} else if (aux[l - left] < aux[r - left]) {
arr[i] = aux[l - left];
++ l;
} else {
arr[i] = aux[r - left];
++ r;
}
}
}
void _mergeSort(std::vector<int>& arr, size_t left, size_t right) {
if (left >= right) return;
size_t mid = left + (right - left) / 2;
_mergeSort(arr, left, mid);
_mergeSort(arr, mid + 1, right);
// optimization, merge arr when arr is out of order
if (arr[mid] > arr[mid + 1]) {
merge(arr, left, mid, right);
}
}
void mergeSort(std::vector<int>& arr) {
_mergeSort(arr, 0, arr.size() - 1);
}
std::vector<int> generateRandomArray(size_t length, size_t rangeFrom, size_t rangeTo);
void printArray(const std::vector<int>& arr);
int main() {
size_t dataSize = 20;
size_t rangeFrom = 1;
size_t rangeTo = 10000;
auto arr = generateRandomArray(dataSize, rangeFrom, rangeTo);
std::cout << "Original array:" << std::endl;
printArray(arr);
mergeSort(arr);
std::cout << "Sorted array:" << std::endl;
printArray(arr);
return 0;
}
/* Randomly generate an array with the `dataSize`, which is from `rangeFrom` to `rangeTo` */
std::vector<int> generateRandomArray(size_t dataSize, size_t rangeFrom, size_t rangeTo) {
size_t range = rangeTo - rangeFrom + 1;
srand(time(nullptr));
std::vector<int> arr(dataSize);
for (size_t i = 0; i < dataSize; ++ i) {
arr[i] = rand() % range + rangeFrom;
}
return arr;
}
/* formatted output array */
void printArray(const std::vector<int>& arr) {
for (const auto& num: arr) {
std::cout << num << " ";
}
std::cout << std::endl;
}