代码

inline void swap(register int &a,register int &b)
{register int t=a;a=b;b=t;}
void qsort(unsigned[],int,int);
void sort(unsigned *a,int n)
{
	qsort(a,0,n-1);
}
void qsort(unsigned Arr[],int L,int R)
{
	if(L>=R)return;
	int i=L,j=R,Mid=(L+R)>>1;
	if(Arr[L]>Arr[Mid])
		swap(Arr[L],Arr[Mid]);
	if(Arr[L]>Arr[R])
		swap(Arr[L],Arr[R]);
	if(Arr[Mid]>Arr[R])
		swap(Arr[Mid],Arr[R]);
	Mid=Arr[Mid];
	while(i<=j)
	{
		while(Arr[i]<Mid&&i<=j)i++;
		while(Arr[j]>Mid&&i<=j)j--;
		if(i<=j)swap(Arr[i],Arr[j]),i++,j--;
	}
	qsort(Arr,L,j);
	qsort(Arr,i,R);
}

评测结果