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
| #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n;
int arr[N]; // 待排序数组
int help[N]; // 辅助数组
void merge(int l, int m, int r){ // 归并过程
int i = l;
int a = l;
int b = m + 1;
while(a <= m && b <= r){
if(arr[a] <= arr[b]){
help[i++] = arr[a++];
}else{
help[i++] = arr[b++];
}
}
while(a <= m){
help[i++] = arr[a++];
}
while(b <= r){
help[i++] = arr[b++];
}
for(int i = l; i <= r; i++){
arr[i] = help[i];
}
}
void mergeSort1(int l, int r){ // 递归实现
if(l >= r){
return;
}
int m = (l + r) / 2;
mergeSort1(l, m);
mergeSort1(m + 1, r);
merge(l, m, r);
}
int main(){ // 主函数
cin >> n;
for(int i = 0; i < n; i++){
cin >> arr[i];
}
mergeSort1(0, n - 1);
for(int i = 0; i < n; i++){
cout << arr[i] << " ";
}
return 0;
}
|
