title: implementing merge sort in C++
body: <p>I have studied the theory of the merge sort but don't have any idea of how to implement it in C++. My question is, merge sort creates arrays in recursion. But when implementing, how do we create arrays in runtime? or what is the general approach for this? </p>
  
  <p>Thanks. </p>