代码

#include <algorithm>
#define swap(x,y) {int t=x;x=y;y=t;}
void sort(unsigned *a, int n) {
	quickSort(a,0,n-1);
}
void quickSort(int* d, int l, int r) {
    int L = l;
    int R = r;
    int mid = d[(l + r) / 2];
    while(L<R){
        while (d[L] < mid)L++;
        while (d[R] > mid)R--;
        swap(d[L], d[R]);
        L++;
        R--;
    }
    if (l < R)quickSort(d, l, R);
    if (r > L)quickSort(d, L, r);
}

评测结果