#include <iostream>
using namespace std;

void quicksort(int *a,int inf, int sup);
int a[10] = {1,3,4,2,299,23,344,1,3,34};

int main()
{
    quicksort(a,0,9);
    for(int i = 0; i<=9;i++)
        cout<<a[i]<<" ";
    return 0;
}

void quicksort(int *a, int inf, int sup)
{
    if (inf<sup)
    {
        int pivot = a[inf];
        int aux;
        int i = inf+1;
        int j = sup;
        while (i<=j)
        {
            while((i<=sup) && (a[i] <=pivot))
                i++;
            while((j>=inf) && (a[j]>pivot))
                j--;
            if ((i<j) && (i<=sup) && (j>=inf))
            {
                aux = a[i];
                a[i] = a[j];
                a[j] = aux;
                i++;
                j--;
            }
        }
        i--;
        a[inf] = a[i];
        a[i] = pivot;
        quicksort(a,inf,i-1);
        quicksort(a,i+1,sup);
    }
}