Vidyalelo
Data Structure · Q328

Sorting Algorithms

Programming · Data Structure · question 328

Q328

What is the auxiliary space complexity of bottom up merge sort?

A.
O(1)
B.
O(n)
Answer
C.
O(log n)
D.
O(n log n)

Answer: Option B

Solution

Answer: Option B
No explanation is given for this question Let's Discuss on Board