Merge sort space complexity is O(n log n)
haashem opened this issue · 1 comments
haashem commented
There are log2(n) levels of recursion and at each level n elements are used. that makes the total O(n log n) in space complexity.
Deleted user commented
No, it's correct. Check this out