Write a JAVA program to sort for an element in a given list of elements using merge sort.



 // Write a JAVA program to sort for an element in
// a given list of elements using merge sort.

import java.util.Scanner;
 
/* Class MergeSort */
public class MergeSort {

    /* Merge Sort function */
    public static void sort(int[] a, int low, int high) {

        int N = high - low;         
        if (N <= 1) 
            return; 
        int mid = low + N/2; 
        // recursively sort 

        sort(a, low, mid); 
        sort(a, mid, high); 

        // merge two sorted subarrays
        int[] temp = new int[N];
        int i = low, j = mid;

        for (int k = 0; k < N; k++) 
        {
            if (i == mid)  
                temp[k] = a[j++];
            else if (j == high) 
                temp[k] = a[i++];
            else if (a[j]