代码

#include<stdio.h>
unsigned a[100010];
void qs(int left,int right){
    int i=left,j=right,k=a[(left+right)/2],t;
    if(left>=right)return;
    while(i<=j){
        while(a[i]<k)i++;
        while(a[j]>k)j--;
        if(i<=j){
            t=a[i];a[i]=a[j];a[j]=t;
            i++;j--;
        }
    }
    if(left<j)qs(left,j);
    if(right>i)qs(i,right);
}

void sort(unsigned *b,int n) {
	for(int i=0;i<n;++i)
		a[i]=b[i];
	qs(0,n-1);
	for(int i=0;i<n;++i)
		b[i]=a[i];
}

评测结果