603 views

2 Answers

Best answer
4 votes
4 votes
Merge sort requires an auxiliary array (as work space) to store it's intermediate result. and it's divide and concur solution so requires stack overhead which is o(logn)   so total space complexity : O(n) + O( logn)  it's in best case as well as worst case.
selected by
–1 votes
–1 votes
I think Best is log n

Worst is  n

Related questions

2 votes
2 votes
1 answer
1
1 votes
1 votes
2 answers
4
Akash Kumar Roy asked Apr 26, 2018
3,932 views
what is Space complexity of Huffman coding?