#include <iostream>
#include <cmath>
#include <algorithm>
#include <math.h>
#include <vector>
#include <fstream>

using namespace std;

const int N = 6;

void mySwap(int &a, int &b) {
    int t = a;
    a = b;
    b = t;
}

void printArray(int arr[]) {
    for (int i = 0; i < N; i++) {
        cout << arr[i] << " ";
    }
    cout << endl;
}

void quickSort(int A[],int left, int rigth) {
    int i = left, j = rigth;
    int pivot = A[(rigth + left)/2];

    while (i <= j) {
        while (A[i] < pivot) i++;
        while (A[j] > pivot) j--;

        if (i <= j) {
            mySwap(A[i], A[j]);
            i++;
            j--;
        }
    }
    printArray(A);
    if (left < j) quickSort(A, left, j);
    if (rigth > i) quickSort(A, i, rigth);
}

int main()
{
    int a[N] = {7, 9, 5, 1, 3, 0};

    quickSort(a, 0, N-1);


    return 0;
}