AcWing 787. 归并排序
原题链接
简单
作者:
khalil
,
2021-05-22 20:37:15
,
所有人可见
,
阅读 214
#include <iostream>
using namespace std;
const int N = 100010;
int q[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, tmp[r-l+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(k=0,i=l;i<=r;k++,i++) q[i] = tmp[k];
}
int main()
{
scanf("%d", &n);
for(int i=0;i<n;i++) scanf("%d", &q[i]);
merge_sort(q, 0, n-1);
for(int i=0;i<n;i++) cout<<q[i]<<" ";
return 0;
}