public static void sort(int vetor[],int begin,int end){

        int i = begin,j=end,aux;
        if(begin >= end)
            return;
        int pivo = vetor[(end + begin) / 2];

        while(i < j){
            while(vetor[i] < pivo)
                i++;
            while(i < j && vetor[j] > pivo)
                j--;

            if(i<j){
                aux = vetor[i];
                vetor[i] = vetor[j];
                vetor[j] = aux;
                //i++;
                //j--;
            }
        }
        if( j < i ){
            aux = i;
            i = j;
            j = aux;
        }

        sort(vetor, begin, i);
        sort(vetor, begin==i ? i+1 : i, j);

    }