归并排序额

include [HTML_REMOVED]
using namespace std;
const int N = 1e5 + 10;

int a[N],tmp[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(i=l,j=0;i<=r;i++,j++) q[i] =tmp[j];
}

int main()
{
int n;
scanf(“%d”,&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;
}

作者：吸溜
链接：https://www.acwing.com/solution/content/120237/
来源：AcWing
著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。