Multiple choice

Complexity of merg sort in the worst case is

  1. n

  2. nlogn

  3. O(nlogn)

  4. O(n)

  5. None of these
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

In computer science, merge sort (also commonly spelled merge sort) is an O(n log n) comparison-based sorting algorithm.

Keep practicing — related questions