C++快速排序的最简单实现，没有之一。

快排的最简单实现 （一个函数实现）

void Qsort(int arr[], int low, int high){
    if (high <= low) return;
    int i = low ,j = high+1 , key = arr[low];
    while(true)
    {
        while(array[++i] < key and i != high);
        while(array[--j] > key and j != low);
        if (i >= j) break;
        swap(arr[i],arr[j]);
    }
    swap(arr[low],arr[j]);
    Qsort(arr, low, j - 1);
    Qsort(arr, j + 1, high);
}  

比较细功能的俩个函数实现

int partition(vector<int> &array, int start, int end) {
    int i = start, j = end, key = array[start];
    while(true)
    {
        while(array[++i] < key and i != end - 1);
        while(array[--j] > key and j != start);
        if (i >= j) break;
        swap(array[i],array[j]);
    }
    swap(array[start], array[j]);
    return j;
}
void quick_sort(vector<int> &array, int start, int end){
    if (start >= end - 1) return;
    int ind = partition(array, start, end);
    quick_sort(array, start, ind);
    quick_sort(array, ind + 1, end);
}  

int main() {
    vector<int> array = {10,5,2,4,1,6,7,8,9,3};
    for_each(cbegin(array), cend(array),[](const auto& x){cout << x << " ";});cout << endl;
    quick_sort(array, 0, array.size());
    for_each(cbegin(array), cend(array),[](const auto& x){cout << x << " ";});
}