Method merge

Programs/MergeSort.java:37–75

(int start, int mid, int end)

    }
 
    private static void merge(int start, int mid, int end) {
        int[] tempArray=new int[arr.length];
        int tempArrayIndex=start;
 
        System.out.print("Before Merging:  ");
        printArray(arr,start,end);
 
        int startIndex=start;
        int midIndex=mid+1;
 
        while(startIndex<=mid && midIndex<=end)
        {
            if(arr[startIndex]< arr[midIndex])
            {
                tempArray[tempArrayIndex++]=arr[startIndex++];
            }
            else
            {
                tempArray[tempArrayIndex++]=arr[midIndex++];
            }
        }
 
        while(startIndex<=mid)
        {
            tempArray[tempArrayIndex++]=arr[startIndex++];
        }
        while(midIndex<=end)
        {
            tempArray[tempArrayIndex++]=arr[midIndex++];
        }
 
        for (int i = start; i <=end; i++) {
            arr[i]=tempArray[i];
        }
 
        System.out.print("After merging:   ");
        printArray(tempArray,start,end);
        System.out.println();
    }
 
    public static void printArray(int arr[],int start,int end)
    {