Multiple choice

Merge sort's average time complexity is

  1. O(n2)

  2. O(nlogn)

  3. O(logn)

  4. O(n)
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

Merge sort consistently performs at O(nlogn) time complexity in all cases - best, average, and worst. The algorithm divides the array log n times and merges n elements at each level, giving nlog n total operations.

Keep practicing — related questions