AcWing 787. 归并排序
原题链接
简单
作者:
muchun
,
2024-04-07 21:09:15
,
所有人可见
,
阅读 1
#include <bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int n,a[N];
void merge_sort(int q[],int l,int r)
{
if(l>=r)
return;
int mid=(l+r)/2;
merge_sort(a,l,mid);
merge_sort(a,mid+1,r);
int k=0,i=l,j=mid+1,temp[N];
while(i<=mid&&j<=r)
{
if(q[i]<=q[j])
temp[k++]=q[i++];
else
temp[k++]=q[j++];
}
while(i<=mid)
temp[k++]=q[i++];
while(j<=r)
temp[k++]=q[j++];
for(k=0,i=l;i<=r;++i)
{
q[i]=temp[k++];
}
}
int main(){
cin >> n;
for(int i=0;i<n;++i)
scanf("%d",&a[i]);
merge_sort(a,0,n-1);
for(int i=0;i<n;++i)
printf("%d ",a[i]);
return 0;
}