Q423
What is the worst case time complexity of merge sort?
A.
O(n log n)
AnswerB.
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