title: Merge sort recursion call stack
body: <p>I am trying to understand how merge sort recursion stack actually manages to merge two arrays into a sorted array. </p>
  
  <p>The code and the output are at - <a href="https://gist.github.com/antani/144a2dfc85d89ae86297" rel="nofollow">https://gist.github.com/antani/144a2dfc85d89ae86297</a> (to prevent clutter in the question)</p>
  
  <p>I am not able to visualize the stack trace of this algorithm</p>