MergeSortMain

//https://pastebin.com/ubuG6ewY     -> MergeSortClass

package MergeSort18313;

import java.util.Scanner;

public class MergeSortMain
{
    public static void main(String args[])
    {
        Scanner scan = new Scanner(System.in);
        System.out.println("Enter length of array");
        int n = scan.nextInt();
        int arr[] = new int[n];
        System.out.println("Enter numbers of array");
        for (int i = 0; i < n; i++)
            arr[i] = scan.nextInt();
        //read an array

        System.out.println("\nUnsorted array");
        for(int i =0; i<arr.length;i++)
            System.out.print(arr[i]+" ");
        //print before sorting

        DivideAndCompare MergeSort = new DivideAndCompare();
        MergeSort.Sort(arr, 0, arr.length-1);
        //sort array

        System.out.println("\nSorted array");
        for(int i =0; i<arr.length;i++)
            System.out.print(arr[i]+" ");
        //print after sorting
    }
}