public void mergeSort(int[] a, int start, int end){
        if(start<end){
            int middle = (start+end)/2;
            mergeSort(a, start, middle);
            mergeSort(a, middle+1, end);
            merge(a, start, middle, end);
        }
    }