Q39

MCQ2 marks, −0.5

Suppose there are $\lceil \log n \rceil$ sorted lists of $\lfloor n /\log n \rfloor$ elements each. The time complexity of producing a sorted list of all these elements is: (Hint:Use a heap data structure)

(A)

$O(n \log \log n)$

(B)

$\Theta(n \log n)$

(C)

$\Omega(n \log n)$

(D)

$\Omega\left(n^{3/2}\right)$

Loading…