Min heap with P distinct element is given. we want to find Kth (k <= Sqrt (P)) smallest element in this heap using best algorithm in O(K log K). (there is k-1 numbers smaller than it exactly)
What is the algorithm in this time complexity? i.e how its work?
from Best Performance on Min heap for Kth element?
No comments:
Post a Comment