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 :
(Hint : Use a heap data structure)
(A) O(n log log n)
(B) θ(n log n)
(C) Ω(n log n)
(D) Ω(n3/2)
Answer: (A)
Explanation: We can merge x arrays of each size y in in O(xy*Logy) time using Min Heap.
x = Logn
y = n/Logn
We get O(n/Logn * Logn * Log Log n) which is O(nLogLogn)
Quiz of this Question