Method mergeSort

Programs/MergeSort.java:25–35

(int start,int end)

    }
 
    public static void mergeSort(int start,int end)
    {
        int mid=(start+end)/2;
        if(start<end)
        {
            mergeSort(start,mid);
            mergeSort(mid+1,end);
            merge(start,mid,end);
        }
 
    }
 
    private static void merge(int start, int mid, int end) {
        int[] tempArray=new int[arr.length];