Suppose there are ⌈ log n ⌉ sorted lists of ⌊ n/log n ⌋ elements each. The…
PYQ GATE 2005
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
- A.
O(n log log n)
- B.
θ(n log n)
- C.
Ω(n log n)
- D.
Ω(n3/2)
Attempted by 697 students.
Sign up free to check your answer
Sign up freeLoading lesson…