代码

void swap(unsigned *a, unsigned *b)
{
	unsigned t = *a; *a = *b; *b = t;
}

void qsort(int l,int r)
{
    int i,j,mid,p;
    i=l;j=r;
    mid=a[(l+r)/2];
    do{
        while(a[i]<mid) i++;
        while(a[j]>mid) j--;
        if(i<=j){
            p=a[i];a[i]=a[j];a[j]=p;
            i++;j--;
        }
    }while(i<=j);
    if(l<j) qsort(l,j);
    if(i<r) qsort(i,r);
}

void sort(unsigned *a, int n)
{
    qsort(1, n);
}

评测结果