Merge k sorted arrays

Merge k sorted arrays using Min heap

Algorithm:

1. Create a HeapNode class with following properties
   1. key
   2. arrayId
   3. arrayIndex
2. Create array to hold merge result
3. Add first element from all sorted array to MinHeap
4. Iterate 0 to n*k
   1. remove min from MinHeap and add to output_array
   2. If remove _element’s array has more element then
      1. add add element from that array to MinHeap
   3. Else
      1. Add some dummy high number to MinHeap
5. Return output_array

Source Code:
Github: MergeKSort.java

Output:

1 3 8 9 15 
20 48 58 67 68 
2 10 22 49 60 

After KSort: 1 2 3 8 9 10 15 20 22 48 49 58 60 67 68