-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathsort.cpp
302 lines (274 loc) · 7.68 KB
/
sort.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
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
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
//
// Created by 晚风吹行舟 on 2021/6/19.
//
#include "gtest/gtest.h"
#include <iostream>
using namespace std;
class Sort {
private:
// 快速排序的辅助数组
int *arr_tmp = nullptr;
public:
void setArrTmp(int n) {
if (arr_tmp != nullptr)
delete arr_tmp;
arr_tmp = new int[n];
}
/**
* 直接插入排序
* @param arr 待排序数组
* @param len 数组长度
*/
void insertSort1(int arr[], int len) {
for (int i = 1; i < len; i++) {
int tmp = arr[i];
int j = i - 1;
for (; j >= 0; j--) {
if (tmp < arr[j])
// 将当前元素后移一位
arr[j + 1] = arr[j];
else
break;
}
arr[j + 1] = tmp;
}
}
/**
* 二分插入排序
* @param arr 待排序数组
* @param len 数组长度
*/
void insertSort2(int arr[], int len) {
}
void bubbleSort(int arr[], int len) {
for (int i = 0; i < len - 1; i++) {
// 用于记录本趟冒泡排序是否发生
bool flag = false;
for (int j = len - 1; j > i; j--) {
if (arr[j] < arr[j - 1]) {
// 前提两个数相加不会溢出
arr[j] = arr[j] + arr[j - 1];
arr[j - 1] = arr[j] - arr[j - 1];
arr[j] = arr[j] - arr[j - 1];
flag = true;
}
}
if (flag == false)
return;
}
}
// 快速排序辅助函数
int partition(int arr[], int low, int high) {
int pivot = arr[low];
while (low < high) {
while (low < high && arr[high] >= pivot) high--;
arr[low] = arr[high];
while (low < high && arr[low] <= pivot) low++;
arr[high] = arr[low];
}
arr[low] = pivot;
return low;
}
/**
* 快速排序 递归
* @param arr 待排序数组
* @param low 起始位置
* @param high 终止位置
*/
void quickSort(int arr[], int low, int high) {
if (low < high) {
int pos = partition(arr, low, high);
quickSort(arr, low, pos - 1);
quickSort(arr, pos + 1, high);
}
}
void merge(int low, int mid, int high, int arr[]) {
// 移动元素到辅助数组中
for (int i = low; i <= high; i++)
arr_tmp[i] = arr[i];
int i = low, j = mid + 1, k = low;
while (i <= mid && j <= high) {
if (arr_tmp[i] < arr_tmp[j]) {
arr[low++] = arr_tmp[i++];
} else {
arr[low++] = arr_tmp[j++];
}
}
while (i <= mid) arr[low++] = arr_tmp[i++];
while (j <= high) arr[low++] = arr_tmp[j++];
}
void mergeSort(int low, int high, int arr[]) {
if (low < high) {
int mid = low + (high - low) / 2;
mergeSort(low, mid, arr);
mergeSort(mid + 1, high, arr);
merge(low, mid, high, arr);
}
}
void heapSort(int arr[], int len) {
// 构建大顶堆
for (int i = len/2;i>=1;i--)
adjustHeap(arr,i,len);
// 堆顶元素与末尾元素交换+重新构建大顶堆
for (int i = len;i>1;i--){
arr[1] = arr[1] + arr[i];
arr[i] = arr[1] - arr[i];
arr[1] = arr[1] - arr[i];
adjustHeap(arr,1,i-1);
}
}
void adjustHeap(int arr[], int start, int len) {
arr[0] = arr[start];
// ? 王道视频13:58显示代码中(...;i<=len;....)为什么？
for (int i = start * 2; i <= len; i *= 2) {
// 使i指向孩子节点中的最大值
if (i < len && arr[i] < arr[i + 1]) {
i++;
}
if (arr[0] >= arr[i]) break;
else {
arr[start] = arr[i];
start = i;
}
}
arr[start] = arr[0];
}
};
class SortTest : public ::testing::Test {
protected:
Sort sort;
int arr1[12] = {4, 1, 5, 6, 8, 2, 15, 32, 47, 12, 3, 6};
int arr2[10] = {13, 15, 21, 3, 41, 25, 31, 10, 5, 12};
protected:
virtual void SetUp() {
}
};
TEST_F(SortTest, InsertSort1) {
sort.insertSort1(arr1, 12);
ASSERT_EQ(arr1[0], 1);
ASSERT_EQ(arr1[1], 2);
ASSERT_EQ(arr1[2], 3);
ASSERT_EQ(arr1[3], 4);
ASSERT_EQ(arr1[4], 5);
ASSERT_EQ(arr1[5], 6);
ASSERT_EQ(arr1[6], 6);
ASSERT_EQ(arr1[7], 8);
ASSERT_EQ(arr1[8], 12);
ASSERT_EQ(arr1[9], 15);
ASSERT_EQ(arr1[10], 32);
ASSERT_EQ(arr1[11], 47);
sort.insertSort1(arr2, 10);
ASSERT_EQ(arr2[0], 3);
ASSERT_EQ(arr2[1], 5);
ASSERT_EQ(arr2[2], 10);
ASSERT_EQ(arr2[3], 12);
ASSERT_EQ(arr2[4], 13);
ASSERT_EQ(arr2[5], 15);
ASSERT_EQ(arr2[6], 21);
ASSERT_EQ(arr2[7], 25);
ASSERT_EQ(arr2[8], 31);
ASSERT_EQ(arr2[9], 41);
}
TEST_F(SortTest, BubbleSort) {
sort.bubbleSort(arr1, 12);
ASSERT_EQ(arr1[0], 1);
ASSERT_EQ(arr1[1], 2);
ASSERT_EQ(arr1[2], 3);
ASSERT_EQ(arr1[3], 4);
ASSERT_EQ(arr1[4], 5);
ASSERT_EQ(arr1[5], 6);
ASSERT_EQ(arr1[6], 6);
ASSERT_EQ(arr1[7], 8);
ASSERT_EQ(arr1[8], 12);
ASSERT_EQ(arr1[9], 15);
ASSERT_EQ(arr1[10], 32);
ASSERT_EQ(arr1[11], 47);
sort.bubbleSort(arr2, 10);
ASSERT_EQ(arr2[0], 3);
ASSERT_EQ(arr2[1], 5);
ASSERT_EQ(arr2[2], 10);
ASSERT_EQ(arr2[3], 12);
ASSERT_EQ(arr2[4], 13);
ASSERT_EQ(arr2[5], 15);
ASSERT_EQ(arr2[6], 21);
ASSERT_EQ(arr2[7], 25);
ASSERT_EQ(arr2[8], 31);
ASSERT_EQ(arr2[9], 41);
}
TEST_F(SortTest, QuickSort) {
sort.quickSort(arr1, 0, 11);
ASSERT_EQ(arr1[0], 1);
ASSERT_EQ(arr1[1], 2);
ASSERT_EQ(arr1[2], 3);
ASSERT_EQ(arr1[3], 4);
ASSERT_EQ(arr1[4], 5);
ASSERT_EQ(arr1[5], 6);
ASSERT_EQ(arr1[6], 6);
ASSERT_EQ(arr1[7], 8);
ASSERT_EQ(arr1[8], 12);
ASSERT_EQ(arr1[9], 15);
ASSERT_EQ(arr1[10], 32);
ASSERT_EQ(arr1[11], 47);
sort.quickSort(arr2, 0, 9);
ASSERT_EQ(arr2[0], 3);
ASSERT_EQ(arr2[1], 5);
ASSERT_EQ(arr2[2], 10);
ASSERT_EQ(arr2[3], 12);
ASSERT_EQ(arr2[4], 13);
ASSERT_EQ(arr2[5], 15);
ASSERT_EQ(arr2[6], 21);
ASSERT_EQ(arr2[7], 25);
ASSERT_EQ(arr2[8], 31);
ASSERT_EQ(arr2[9], 41);
}
TEST_F(SortTest, MergeSort) {
sort.setArrTmp(12);
sort.mergeSort(0, 11, arr1);
ASSERT_EQ(arr1[0], 1);
ASSERT_EQ(arr1[1], 2);
ASSERT_EQ(arr1[2], 3);
ASSERT_EQ(arr1[3], 4);
ASSERT_EQ(arr1[4], 5);
ASSERT_EQ(arr1[5], 6);
ASSERT_EQ(arr1[6], 6);
ASSERT_EQ(arr1[7], 8);
ASSERT_EQ(arr1[8], 12);
ASSERT_EQ(arr1[9], 15);
ASSERT_EQ(arr1[10], 32);
ASSERT_EQ(arr1[11], 47);
sort.mergeSort(0, 9, arr2);
ASSERT_EQ(arr2[0], 3);
ASSERT_EQ(arr2[1], 5);
ASSERT_EQ(arr2[2], 10);
ASSERT_EQ(arr2[3], 12);
ASSERT_EQ(arr2[4], 13);
ASSERT_EQ(arr2[5], 15);
ASSERT_EQ(arr2[6], 21);
ASSERT_EQ(arr2[7], 25);
ASSERT_EQ(arr2[8], 31);
ASSERT_EQ(arr2[9], 41);
}
TEST_F(SortTest, heapSort) {
sort.heapSort(arr1,11);
ASSERT_EQ(arr1[1], 1);
ASSERT_EQ(arr1[2], 2);
ASSERT_EQ(arr1[3], 3);
ASSERT_EQ(arr1[4], 5);
ASSERT_EQ(arr1[5], 6);
ASSERT_EQ(arr1[6], 6);
ASSERT_EQ(arr1[7], 8);
ASSERT_EQ(arr1[8], 12);
ASSERT_EQ(arr1[9], 15);
ASSERT_EQ(arr1[10], 32);
ASSERT_EQ(arr1[11], 47);
sort.heapSort(arr2,9);
ASSERT_EQ(arr2[1], 3);
ASSERT_EQ(arr2[2], 5);
ASSERT_EQ(arr2[3], 10);
ASSERT_EQ(arr2[4], 12);
ASSERT_EQ(arr2[5], 15);
ASSERT_EQ(arr2[6], 21);
ASSERT_EQ(arr2[7], 25);
ASSERT_EQ(arr2[8], 31);
ASSERT_EQ(arr2[9], 41);
}