AcWing 787. 归并排序
原题链接
简单
作者:
江鲤
,
2023-01-08 22:28:44
,
所有人可见
,
阅读 118
#include<iostream>
using namespace std;
const int N = 100000;
int q[N], tmp[N];
int n;
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++];
for (int i = l, j = 0; i <= r; j++, i++) {
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]<< " " ;
}