A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. Suppose there are logn sorted lists of n logn elements each. The time complexity of producing a sorted list of all these elements is (use heap data structure)
a. O (n log logn)
b. θ(n logn)
c. Ω(n logn)
d. Ω(n3/2)
Answer:O (n log logn)
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: