Merge sort test suite (interview task)

MergeSortTest.java

package interview;

import java.util.Arrays;

class MergeSortTest {

    public static void main(String[] args) {

        int[][] sourceData = {
                { },
                { 1 },
                { 1, 1, 1 },
                { 1, 2, 3 },
                { 3, 2, 1 },
                { 0, -1, 1 },
                { 80, 9, 1, 5 },
                { 1, 10, 8, 4, 8 }
        };
        int[][] expectedData = {
                { },
                { 1 },
                { 1, 1, 1 },
                { 1, 2, 3 },
                { 1, 2, 3 },
                { -1, 0, 1 },
                { 1, 5, 9, 80 },
                { 1, 4, 8, 8, 10 }
        };
        MergeSort sort = new MergeSort();
        for (int i = 0; i < sourceData.length; i++) {

            int[] source = sourceData[i];
            int[] test = new int[source.length];
            System.arraycopy(source, 0, test, 0, source.length);
            int[] expected = expectedData[i];

            sort.sort(test);

            if (!Arrays.equals(test, expected)) {
                throw new RuntimeException(
                        "Sort failed. Source data set: " + Arrays.toString(source) +
                        ", expected result: " + Arrays.toString(expected) +
                        ", actual result: " + Arrays.toString(test));
            }
            System.out.println("Case number " + i + " succeeded");
        }
    }

}