Objective: Given k sorted array, write an algorithm to merge Them into One sorted array.
Example :
int[][] A = new int[5][]; A[0] = new int[] { 1, 5, 8, 9 }; A[1] = new int[] { 2, 3, 7, 10 }; A[2] = new int[] { 4, 6, 11, 15 }; A[3] = new int[] { 9, 14, 16, 19 }; A[4] = new int[] { 2, 4, 6, 9 }; Output: [1, 2, 2, 3, 4, 4, 5, 6, 6, 7, 8, 9, 9, 9, 10, 11, 14, 15, 16, 19]