Worst case space complexity of Merge Sort is:

1
\(\rm {\rm{O}}\left( {\log {\rm{n}}} \right)\)
2
\(\rm O(n)\)
3
\(\rm O(n \log {n})\)
4
\(\rm {\rm{O}}\left( {{{\rm{n}}^2}} \right)\)

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Quick Navigation