Question: What is the space complexity of quick sort and merge sort algorithm? A. O (n log2 n), O (log2 n) B. O (log2 n), O
What is the space complexity of quick sort and merge sort algorithm?
A. O (n log2 n), O (log2 n)
B. O (log2 n), O (n)
C. O (n), O (log2 n)
D. O (1), O (n)
Step by Step Solution
3.54 Rating (158 Votes )
There are 3 Steps involved in it
B Explanation The space ... View full answer
Get step-by-step solutions from verified subject matter experts
