编辑代码

#include <stdio.h>
void quicksort(int *arr, int left, int right) {
    if (left >= right) {
        return;
    }
    int i = left;
    int j = right;
    int key = arr[left];

    while (i < j) {
        while (i < j && key <= arr[j]) {
            j--;
        }
        arr[i] = arr[j];
        while (i < j && key >= arr[i]) {
            i++;
        }
        arr[j] = arr[i];
    }
    arr[i] = key;
    quicksort(arr, left, i - 1);
    quicksort(arr, i + 1, right);
}
int main() {
    int arr[] = {9,8,7,6,5,4,3,2,1};
    int len = sizeof(arr) / sizeof(arr[0]);
    quicksort(arr, 0, len - 1);
    for (int i = 0; i < len; i++) {
        printf("%d ", arr[i]);
    }
    return 0;
}