代码如下
void quick_sort(int arr[], int left, int right) {
if (left >= right) return;
int x = arr[left], i = left - 1, j = right + 1;
while (i < j) {
do i++; while (arr[i] < x);
do j--; while (arr[j] > x);
if (i < j) swap(arr[i],arr[j]);
}
quick_sort(arr, left, j);
quick_sort(arr, j + 1, right);
}