快速排序（个人总结）

快速排序我个人总结起来就是，left<right，找右大左小；做完一次分区继续分区（这里用递归）

#include<stdio.h>

void swap(int *a, int *b) {
    int temp = *a;
    *a = *b;
    *b = temp;
}

int partition(int a[], int low, int high) {
    int key = low;
    int left = low + 1;
    int right = high;
    while (left < right) {
        while (left < right && a[right] >= a[key]) {
            right--;
        }
        while (left < right && a[left] <= a[key]) {
            left++;
        }
        swap(&a[left], &a[right]);
    }
    if (a[left] >= a[key]) {
        swap(&a[key], &a[left - 1]);
        return left - 1;
    } else {
        swap(&a[key], &a[left]);
        return left;
    }
}

void quickSort(int a[], int low, int high) {
    if (low < high) {
        int pi = partition(a, low, high);
        quickSort(a, low, pi - 1);
        quickSort(a, pi + 1, high);
    }
}

int main() {
    int a[20];
    for (int i = 0; i < 10; i++) {
        scanf("%d", &a[i]);
    }
    quickSort(a, 0, 9);
    for (int i = 0; i < 10; i++) {
        printf("%d ", a[i]);
    }
    return 0;
}