Add to Chrome
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
What is the worst-case time complexity of merge sort?
O(n2 log n)
)
O(nlog n)
O(n)
O(n3)
O(1)
Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!