acwing归并排序

1，确定分界点mid

2，递归两段

3，合并

#include<iostream>

using  namespace std;

const int N =1e6+10;

int a[N],tmp[N];//a为原序列和结果序列，tmp为辅助序列 

void merge_sort(int q[],int l,int r)
{
   if(l>=r)return ;

   int mid=(l+r)/2;//分界 

   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;




}