代码

#include <bits/stdc++.h>
using namespace std;
void qsort(unsigned a[],unsigned l,unsigned r){
    unsigned i = l,j = r,mid = a[l + (r - l) / 2];
    do{
        while(a[j] > mid) j--;
        while(a[i] < mid) i++;
        if(i <= j) swap(a[i++],a[j--]);
    } while(i <= j);
    if(i < r) qsort(a,i,r);
    if(l < j) qsort(a,l,j);
}
void sort(unsigned *a, int n){
    qsort(a,0,--n);
}

评测结果