Multiple choice

Suppose there are log n sorted lists of n/ log n elements each. The time complexity of producing a sorted list of all these elements is:

  1. O(nloglogn)
  2. $\theta$(nlogn)
  3. $\Omega$ (nlogn)
  4. $\Omega$(n3/2)
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

Keep practicing — related questions