#include "stdio.h"
void quickSort(int arr[], int left, int right) {
if(left >= right)return;
int base = arr[left], l = left, r = right;
while (l < r) {
while (l < r && arr[r] >= base) r--;
arr[l] = arr[r];
while (l < r && arr[l] <= base) l++;
arr[r] = arr[l];
}
arr[r] = base;
quickSort(arr, left, r - 1);
quickSort(arr, r + 1, right);
}
int main() {
int arr[] = {1099, 453234, 77, 62367, 556, 23322, 434, 122};
quickSort(arr, 0, 7);
for (int i = 0; i < 8; i++) {
printf("% d", arr[i]);
}
}
对于快速排序算法,有没有更快捷简便的方法!!