#include <iostream>
#include <vector>

using namespace std;

class ordenacao{
    public:
        void selectionSort(int v[6]) {
            int min,i,j,aux;
            for(i = 0; i < 5; i++) {
                min = i;
                for (j = i+1; j < 6; j++) {
                    if (v[j] < v[min]) {
                        min = j;
                    }
                }
                aux = v[i];
                v[i] = v[min];
                v[min] = aux;
            }
        }

        int divida(int *v, int ini, int fim, int pivot) {
            int i,j,aux;
            i = ini;
            j = fim;
            while (i < j) {
                while (v[i] < pivot) {
                    i++;
                }while (v[j] > pivot) {
                    j--;
                }
                aux = i;
                i = j;
                j = aux;
                //swap(v,i,j);
                if (i < j && pivot == v[i] && pivot == v[j]) {
                    i++;
                }
            }
            return i;
        }

        void quickSort(int *v,int ini,int fim) {
            int pv = v[ini], pi;
            if (ini < fim) {
                pi = divida(v,ini,fim,pv);
                quickSort(v,ini,pi-1);
                quickSort(v,pi+1,fim);
            }
        }
};

int main()
{
    ordenacao o;
    int v[6];
    v[0] = 22;
    v[1] = 33;
    v[2] = 55;
    v[3] = 44;
    v[4] = 88;
    v[5] = 77;
    for (int i = 0; i < 6; i++){
        cout <<v[i]<<"\t";
    }
    cout << endl;
    o.quickSort(v,0,5);
    o.selectionSort(v);
    return 0;
}