static int pivot(int[]t, int i, int j){
        //int[] res = new int[j-i+1];
        int p = t[j];
        int indexD=i-1;
        //int indiceG=0;
        //int indiceD = res.length-1;
        for (int k = i; k < j; k++) {
            if (t[k] <= p){
                indexD++;
                int temp = t[indexD];
                t[indexD] = t[k];
                t[k]= temp;
            }
        }
        int temp = t[indexD+1];
        t[indexD+1] = t[j];
        t[j]= temp;

        //System.out.println(afficherTab(t));
        return indexD+1;
    }