title: Merge two minimum-heaps to one heap in efficiency?
body: <p>Consider two min-heaps H1,H2 of size n1 and n2 respectively, such that every node in H2 is greater than every node of H1.  </p>
  
  <p>How can I merge this two heaps into one heap "H" , in O(n2) (not O(n^2)..)?<br>
  (Assume that the heaps represented in arrays of size > n1+n2)</p>