快速排序的递归实现

int partition(int arr[], int low, int high);

void quickSort(int arr[], int low, int high)
{
    int pivotKey = partition(arr, low, high);
    quickSort(arr, low, pivotKey - 1);
    quickSort(arr, pivotKey + 1, high);
}

int partition(int arr[], int low, int high)
{
    arr[0] = arr[low];
    while (low < high)
    {
        while (low < high && arr[high] > arr[0]) high--;
        arr[low] = arr[high];
        while (low < high && arr[low] < arr[0]) low++;
        arr[high] = arr[low];
    }
    return low;
}

转载于:https://www.cnblogs.com/kimimaro/archive/2011/03/29/1999302.html