void quicksort(int *arr, int left, int right)
{
int key = arr[left];
int low = left;
int high = right;
if (low >= high)
{
return;
}
while (low < high)
{
while (low < high && arr[high] >= key) // 找到第一个小于key的数
high--;
arr[low] = arr[high]; //交换位置,第一次交换是与key交换 即arr[0]
while (low < high && arr[low] <= key) //找到第一个大于key的数
low++;
arr[high] = arr[low]; //交换位置
}
arr[low] = key; //low == high时 arr[low] 就是key值
quicksort(arr, left, low - 1);
quicksort(arr, low + 1, right);
}
{
int key = arr[left];
int low = left;
int high = right;
if (low >= high)
{
return;
}
while (low < high)
{
while (low < high && arr[high] >= key) // 找到第一个小于key的数
high--;
arr[low] = arr[high]; //交换位置,第一次交换是与key交换 即arr[0]
while (low < high && arr[low] <= key) //找到第一个大于key的数
low++;
arr[high] = arr[low]; //交换位置
}
arr[low] = key; //low == high时 arr[low] 就是key值
quicksort(arr, left, low - 1);
quicksort(arr, low + 1, right);
}