快速排序

#include <iostream>

using namespace std;

void quickSort(int *ar, int left, int right) {
    int i = left;
    int j = right;
    while (i < j) {
        int pivot = ar[left];
        while (i < j && ar[j] >= pivot) {
            j--;
        }
        if (ar[j] < pivot) {
            int tmp = ar[j];
            ar[j] = ar[i];
            ar[i] = tmp;
        }
        while (i < j && ar[i] <= pivot) {
            i++;
        }
        if (ar[i] > pivot) {
            int tmp = ar[j];
            ar[j] = ar[i];
            ar[i] = tmp;
        }
        quickSort(ar, left, i - 1);
        quickSort(ar, i + 1, right);
    }
}


int main() {
    int ar[10] = {1,2,4,7,3,10,9,5,8,6};
    quickSort(ar, 0, 9);
    for (int i = 0; i < 9; ++i) {
        cout << ar[i] << " ";
    }
    cout << endl;
}