-
Notifications
You must be signed in to change notification settings - Fork 732
Expand file tree
/
Copy pathtimSort.cpp
More file actions
94 lines (75 loc) · 2.04 KB
/
Copy pathtimSort.cpp
File metadata and controls
94 lines (75 loc) · 2.04 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
#include <iostream>
#include <vector>
#include <algorithm>
const int RUN = 32;
// Insertion Sort function
void insertionSort(std::vector<int>& arr, int left, int right) {
for (int i = left + 1; i <= right; ++i) {
int key = arr[i];
int j = i - 1;
while (j >= left && arr[j] > key) {
arr[j + 1] = arr[j];
j--;
}
arr[j + 1] = key;
}
}
// Merge function to merge two sorted runs
void merge(std::vector<int>& arr, int left, int mid, int right) {
int len1 = mid - left + 1;
int len2 = right - mid;
std::vector<int> leftArr(len1);
std::vector<int> rightArr(len2);
for (int i = 0; i < len1; i++) {
leftArr[i] = arr[left + i];
}
for (int i = 0; i < len2; i++) {
rightArr[i] = arr[mid + 1 + i];
}
int i = 0, j = 0, k = left;
while (i < len1 && j < len2) {
if (leftArr[i] <= rightArr[j]) {
arr[k++] = leftArr[i++];
}
else {
arr[k++] = rightArr[j++];
}
}
while (i < len1) {
arr[k++] = leftArr[i++];
}
while (j < len2) {
arr[k++] = rightArr[j++];
}
}
// Tim Sort function
void timSort(std::vector<int>& arr, int n) {
for (int i = 0; i < n; i += RUN) {
insertionSort(arr, i, std::min((i + RUN - 1), (n - 1)));
}
for (int size = RUN; size < n; size = 2 * size) {
for (int left = 0; left < n; left += 2 * size) {
int mid = std::min((left + size - 1), (n - 1));
int right = std::min((left + 2 * size - 1), (n - 1));
if (mid < right) {
merge(arr, left, mid, right);
}
}
}
}
int main() {
std::vector<int> arr = {5, 21, 7, 23, 19, 11, 47, 3};
int n = arr.size();
std::cout << "Original Array: ";
for (int num : arr) {
std::cout << num << " ";
}
std::cout << std::endl;
timSort(arr, n);
std::cout << "Sorted Array: ";
for (int num : arr) {
std::cout << num << " ";
}
std::cout << std::endl;
return 0;
}