Vidyalelo
Data Structure · Q68

Sorting Algorithms

Programming · Data Structure · question 68

Q68

What is the average time complexity of bottom up merge sort?

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

Answer: Option A

Solution

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