归并排序
归并排序的算法思想
归并排序的模板
#include<iostream>
#include<algorithm>
using namespace std;
int a[N],temp[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]) temp[k++]=q[i++];
else temp[k++]=q[j++];
}
while(i<=mid)
{
temp[k++]=q[i++];
}
while(j<=r)
{
temp[k++]=q[j++];
}
for(int i=0,j=l;j<=r;j++,i++)
{
q[j]=temp[i];
}
}