代码

inline void merge(unsigned*a,int l,int mid,int r)
{
	unsigned tmp[r-l+1];
	int p(l),q(mid+1),k(0);
	while(p<=mid&&q<=r)
		tmp[k++]=a[(a[p]<a[q]?p:q)++];
	while(p<=mid)
		tmp[k++]=a[p++];
	while(q<=r)
		tmp[k++]=a[q++];
	k=0;while(l<=r)a[l++]=tmp[k++];
}
void msort(unsigned*a,int l,int r)
{
	if(l<r)
	{
		int mid((l+r)>>1);
		msort(a,l,mid),msort(a,mid+1,r);
		if(a[mid+1]<a[mid])merge(a,l,mid,r);
	}
}
void sort(unsigned*a,int n){msort(a,0,n-1);}

评测结果