代码

unsigned b[100005];
void msort(unsigned * a,int l0,int r0){
	if(l0>=r0)return;
	int i1,i2,i3=(l0+r0)>>1,i4=l0-1;
	msort(a,l0,i3);
	msort(a,i2=(i3+1),r0);
	for(i1=l0;i1<=i3;++i1){
		while((i2<=r0)&&(a[i2]<a[i1])){
			b[++i4]=a[i2];
			++i2;
		}
		b[++i4]=a[i1];
	}
	for(i1=l0;i1<=i4;++i1)a[i1]=b[i1];
	return;
}
void sort(unsigned *a, int n) {
	msort(a, 0, n-1);
}

评测结果