代码

#include <algorithm>


void QuickSort_GuoYuanPeng(unsigned data[], int left, int right) {
    if (left >= right) {
        return;
    }
    int first = left;
    int last = right;
    int key = data[first];
    while (first < last) {
        while (first < last && data[last] >= key) {
            last--;
        }
        data[first] = data[last];
        while (first < last && data[first] <= key) {
            first++;
        }
        data[last] = data[first];
    }
    data[first] = key;
    QuickSort_GuoYuanPeng(data, left, first - 1);
    QuickSort_GuoYuanPeng(data, first + 1, right);
}

void sort(unsigned *a, int n) {
	QuickSort_GuoYuanPeng(a, 0, n);
}

评测结果