代码

void qsort(unsigned* const a,int l0,int r0){
	if(l0>=r0)return;
	int i1=l0,i2=r0;
unsigned i3=a[(l0+r0)>>1],i4;
	while(i1<=i2){
		while(a[i1]<i3)++i1;
		while(a[i2]>i3)--i2;
		if(i1>=i2)break;
		i4=a[i1];
		a[i1]=a[i2];
		a[i2]=i4;
		++i1;--i2;
	}
	qsort(a,l0,i1-1);
	qsort(a,i2+1,r0);
	return;
}
void sort(unsigned *a, int n) {
	qsort(a, 0,n-1);
}

评测结果