Home »
MCQs »
Algorithms MCQs
What is the best-case time complexity of the Merge Sort algorithm?
2. What is the best-case time complexity of the Merge Sort algorithm?
- O(n)
- O(n log n)
- O(n^2)
- O(log n)
Answer
The correct answer is: B) O(n log n)
Explanation
Merge Sort has a best-case time complexity of O(n log n), the same as its average and worst-case complexities.