Merge sort space is O(n) not O(1) #18
Description
Need to update merge sort space complexity to O(n)
It was odd to me that merge sort stats here are "better" than quick sort in every way - whereas Quicksort is used everywhere in practice, not Mergesort.
Why is QuickSort favourable over MergeSort in practice?
https://www.reddit.com/r/computerscience/comments/6krpz7/why_is_quicksort_favourable_over_mergesort_in/
Quicksort is used bc is has better space complexity than merge. Merge should be O(n)
