Merge K Sorted Arrays in Java
This is a classic interview question. Another similar problem is "merge k sorted lists".
This problem can be solved by using a heap. The time complexity is O(nlog(k)), where n is the total number of elements and k is the number of arrays.
It takes O(log(k)) to insert an element to the heap and it takes O(log(k)) to delete the minimum element.
class ArrayContainer implements Comparable<ArrayContainer> { int[] arr; int index; public ArrayContainer(int[] arr, int index) { this.arr = arr; this.index = index; } @Override public int compareTo(ArrayContainer o) { return this.arr[this.index]  o.arr[o.index]; } } 
public class KSortedArray { public static int[] mergeKSortedArray(int[][] arr) { //PriorityQueue is heap in Java PriorityQueue<ArrayContainer> queue = new PriorityQueue<ArrayContainer>(); int total=0; //add arrays to heap for (int i = 0; i < arr.length; i++) { queue.add(new ArrayContainer(arr[i], 0)); total = total + arr[i].length; } int m=0; int result[] = new int[total]; //while heap is not empty while(!queue.isEmpty()){ ArrayContainer ac = queue.poll(); result[m++]=ac.arr[ac.index]; if(ac.index < ac.arr.length1){ queue.add(new ArrayContainer(ac.arr, ac.index+1)); } } return result; } public static void main(String[] args) { int[] arr1 = { 1, 3, 5, 7 }; int[] arr2 = { 2, 4, 6, 8 }; int[] arr3 = { 0, 9, 10, 11 }; int[] result = mergeKSortedArray(new int[][] { arr1, arr2, arr3 }); System.out.println(Arrays.toString(result)); } } 
<pre><code> String foo = "bar"; </code></pre>

Bonsai

p.andrey

rambabu kokkiligadda

Gaurang Bhatt

Hayro

Hayro

Sheetal

Kurt Maegerle

Ankit Shah

srrm

srrm

Holden

Holden