quick_sort

#include <iostream>
#include <stdio.h>
int quick_sort(int *a, int left, int right);


int main(){
    using namespace std;
    int a[10] = {5, 3, 4, 7, 6, 9, 2, 8, 1};
    int  N_1 = 10;
    quick_sort(a, 0, N_1-1);
    for (int i = 0; i < N_1; i++) {
        cout << a[i] << " ";
  }
}


int quick_sort(int *a, int left, int right){
    if (left == right || left == right+1)
        return 0;
    else {
        int i = left;
        int j = right;
        int temp = a[i];
        while (i < j) {
            while (i < j && a[j] <= temp) {
                j = j - 1;
            }
            if (i < j) {
                a[i] = a[j];
                i++;
            }
            while (i < j && a[i] >= temp) {
                i = i + 1;
            }
            if (i < j) {
                a[j] = a[i];
                j--;
            }
        }
        a[i] = temp;
        quick_sort(a, left, i-1);
        quick_sort(a, i+1, right);
    }
}