代码

unsigned divide(unsigned *array, int low, int high) {
    unsigned temp = array[low];
    while (low < high) {
        while (low < high && array[high] >= temp)high--;
        if (low < high)array[low] = array[high], low++;
        while (low < high && array[low] <= temp)low++;
        if (low < high)array[high] = array[low], high--;
    }
    array[low] = temp;
    return low;
}

void quickSort(unsigned *array, int low, int high) {
    if (low >= high)return;
    int mid = divide(array, low, high);
    quickSort(array, low, mid - 1);
    quickSort(array, mid + 1, high);
}

void sort(unsigned *a, int n) {
	quickSort(a, 0, n - 1);
}

评测结果