Multiple choice technology

What is the best time complexity for Merge sort?

  1. n^2

  2. n

  3. logn

  4. nlogn
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

Merge sort consistently performs at O(n log n) time complexity across all cases - best, average, and worst. This is because it always divides the array in half (log n levels) and merges n elements at each level. The n log n complexity is its fundamental characteristic.

Keep practicing — related questions