title: How to sort K sorted arrays, with MERGE SORT
body: <p>I know that this question has been asked, and there is a very nice elegant solution using a min heap.</p>
  
  <p>MY question is how would one do this using the merge function of merge sort.</p>
  
  <p>You already have an array of sorted arrays.  So you should be able to merge all of them into one array in O(nlog K) time, correct?</p>
  
  <p>I just can't figure out how to do this!  </p>
  
  <p>Say I have</p>
  
  <p>[ [5,6], [3,4], [1,2], [0] ]</p>
  
  <p>Step 1: [ [3,4,5,6], [0,1,2] ]</p>
  
  <p>Step2:  [ [0,1,2,3,4,5,6] ]</p>
  
  <p>Is there a simple way to do this?  Is O(nlog K) theoretically achievable with mergesort?</p>