Simple explanation of Frederickson's heap selection algorithm

1.9k Views Asked by At

Is there any simple explanation of Frederickson's heap selection algorithm to find the k'th ranked element in O(k) time in a min-heap available anywhere online? If not, can anyone explain the gut of the algorithm?

1

There are 1 best solutions below

4
On