Q290
How many elements can be sorted in O(logn) time using Heap sort?
A.
O(1)
B.
O(n/2)
C.
O(logn/log(logn))
AnswerD.
O(logn)
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board