#include <bits/stdc++.h>
using namespace std;

int arr[] = {1,3,2,4,6,5};

void qsort(int left, int right){
    if(left >= right)
        return;
    int big = -1;
    for(int i = left; i < right; i++){
        if(arr[i] < arr[right]){
            if(big != -1){
                swap(arr[i], arr[big]);
                big++;
            }
        }
        else{
            if(big == -1)
                big = i;
        }
    }
    if(big == -1)
        big = right;
    swap(arr[big], arr[right]);
    qsort(left, big-1);
    qsort(big+1, right);
}

int main(){
    qsort(0, 5);
    for(int i = 0; i < 6; i++)
        cout << arr[i] << ' ';

    return 0;
}