Multiple choice technology web technology

Which of the following has average case complexity O(n ln(n))

  1. Merge Sort

  2. Selection Sort

  3. Bubble Sort

  4. Insersion Sort
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

Merge Sort has O(n log n) average and worst-case time complexity because it divides the array in half recursively (log n levels) and merges n elements at each level. Selection Sort, Bubble Sort, and Insertion Sort are all O(n^2).

Keep practicing — related questions