AcWing 787. 归并排序
原题链接
简单
作者:
wzc1998
,
2021-01-13 21:22:11
,
所有人可见
,
阅读 299
#include <iostream>
using namespace std;
int n;
const int maxn = 100010;
int q[maxn], tmp[maxn];
void merge_sort(int q[], int l, int r){
// 递归边界
if(l >= r) return;
// 确定分界点
int mid = l + r >> 1;
// 递归处理左右两段
merge_sort(q, l, mid);
merge_sort(q, mid + 1, r);
// 两路归并,合二为一
int k = 0, i = l, j = mid + 1;
while(i <= mid && j <= r){
if(q[i] < q[j]) tmp[k ++] = q[i ++];
else tmp[k ++] = q[j ++];
}
while(i <= mid) tmp[k ++] = q[i ++];
while(j <= r) tmp[k ++] = q[j ++];
// copy回去
for(i = l, j = 0; i <= r; i ++, j ++) q[i] = tmp[j];
}
int main(){
cin >> n;
for(int i = 0; i < n; i ++){
cin >> q[i];
}
merge_sort(q, 0, n - 1);
for(int i = 0; i < n; i ++){
cout << q[i] << " ";
}
return 0;
}
tql!
这id很强
气势不能输