What is the best-case time complexity of merge sort?

Sorting Algorithms Questions



80 Short 66 Medium 49 Long Answer Questions Question Index

What is the best-case time complexity of merge sort?

The best-case time complexity of merge sort is O(n log n).