import java.util.Arrays;

public class MergeSort_Algo_split {
    public static void main(String[] args)
    {
        int[] ary = new int[]{20, 9, 3, 10, 300, 201, 11, 100 };
        split(ary);
        printArray(ary);
    }

    private static void split(int[] ary) {
//        if (ary.length == 0) return;
        if (ary.length == 1) return;
        split(subArray(ary, 0, ary.length/2));
        split(subArray(ary, ary.length/2, ary.length));
    }


    ///// Util Only below /////

    public static int[] subArray(int[] array, int beg, int end) {
        return Arrays.copyOfRange(array, beg, end);
    }

    private static void printArray(int[] ary){
        for (int i = 0; i < ary.length; i++) {
            System.out.printf("%4d" , ary[i]);
        }
        System.out.println();
    }
    private static void print2DArray(int[][] ary){
        for (int i = 0; i < ary.length; i++) {
            for (int j = 0; j < ary[i].length; j++) {
                System.out.printf("%4d" , ary[i][j]);
            }
            System.out.println();
        }
    }
}