title: Why is recursive Merge Sort preferred over iterative Merge Sort even though the latter has auxillary space complexity?
body: <p>While studying about Merge Sort algorithm, I was curious to know if this sorting algorithm can be further optimised. Found out that there exists Iterative version of Merge Sort algorithm with same time complexity but even better <code>O(1)</code> space complexity. And Iterative approach is always better than recursive approch in terms of performance. Then why is it less common and rarely talked about in any regular Algorithm course?
  <a href="https://www.techiedelight.com/iterative-merge-sort-algorithm-bottom-up/" rel="nofollow noreferrer">Here's the link to Iterative Merge Sort algorithm</a></p>