Main - MergeSort

package MergeSort183_02;
import java.util.Arrays;
import java.util.Scanner;
import static MergeSort183_02.MergeSort_Methods.Divide;

public class MergeSort_Main {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        System.out.println("Input number of elements : ");

        int N = scan.nextInt();
        int [] ARR = new int[N];

        for (int i = 0; i < N ; i++) {

            System.out.println("Input element [" + i + "] : ");
            ARR[i] =scan.nextInt();

        }
        System.out.println("BEFORE SORTING : " + Arrays.toString(ARR));

        Divide(ARR,0,N-1);

        System.out.println("AFTER SORTING : " + Arrays.toString(ARR));

    }
}