Sail E0 Webinar
Question
The number of elements that can be sorted in Θ(log n) time using heap sort is
Options:
A .  Î˜(1)
B .  Î˜(√log n)
C .  Î˜(log n/log log n)
D .  Î˜(log n)
Answer: Option C


-NA-



Was this answer helpful ?
Next Question

Submit Solution

Your email address will not be published. Required fields are marked *

More Questions on This Topic :


Latest Videos

Latest Test Papers