title: why is the standard merge sort not in place?
body: <p>In the merge algorithm of merge sort, I don't understand we have to use auxiliary arrays L, R? Why can't we just keep 2 pointers corresponding which element we're comparing in the 2 subarrays L and R so that the merge-sort algorithm remains inplace?</p>
  
  <p>Thanks.</p>