title: Writing algorithm
body: <p>I think the algorithm would be Theta(mj) since we need to go through all m sorted lists each of which has size j. </p>
  
  <p>Would it have to be iterative or recursive?</p>
  
  <pre><code>def mymerge(L1, L2,..., Lm):
  
      A = merge(L1,L2)
      return A + mymerge(L3,...., Lm)
  </code></pre>