是否有弗雷德里克森的堆选择算法，任何简单的解释，找到第k在分堆可用排名元素O（k）的时间，任何地点上网吗？如果没有，任何人都可以解释算法的肠？

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?

推荐答案

谷歌搜索弗雷德里克森堆选择返回他的论文作为第一个结果。

Googling "frederickson heap select" returns his paper as the first result.

HTTP：//ftp.cs.purdue。教育/科研/ technical_reports / 1991 / TR％2091-027.pdf