private void insert(int[] a, int left, int right, int value) {
        int i = right-1;
        System.out.println("before i=" + i + " left="+ left+" right=" +right +" value=" +value);
        System.out.println("before i=" + i + " a[i+1]="+ a[i+1]+" a[i]=" +a[i]);
        while (i >= left && a[i] > value) {
       System.out.println("during i=" + i + " a[i+1]="+ a[i+1]+" a[i]=" +a[i]);
       a[i+1] = a[i];
       i--;
        }
        a[i+1] = value;
        for(i=left;i<right-1;i++)
       System.out.println("after i=" + i + " a[i]=" +a[i]);
    }
    public void insertionSort(int[] a, int left, int right) {
        int i = left;
        while (i < right) {
       System.out.println("i="+i + " right=" +right + "left= " +left+ "a[i]=" + a[i]);
       insert(a, i, right, a[i]);
       i++;
        }
    }