title: merging sorted arrays
body: <blockquote>
    <p><strong>Possible Duplicates:</strong><br>
    <a href="https://stackoverflow.com/questions/2348374/merging-two-sorted-lists">Merging two sorted lists</a><br>
    <a href="https://stackoverflow.com/questions/5055909/algorithm-for-n-way-merge">Algorithm for N-way merge</a>  </p>
  </blockquote>
  
  
  
  <p>Given k sorted arrays each of length n, construct a single merged and sorted array.focus on running time and space complexity.</p>
  
  <p>Source : Amazon interview question.<br>
  Any thoughts? thanks</p>