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?
Asked
Active
Viewed 1,890 times
1 Answers
2
Try googling "frederickson heap select".
wim
- 338,267
- 99
- 616
- 750
Keith Ripley
- 1,020
- 1
- 10
- 18
-
I wanted something that explained the core of the algorithm in a page or 2 rather than 27 pages. – dhruvbird Aug 18 '12 at 05:33
-
1The core of the algorithm is described in about a page or two starting on page 17. – Keith Ripley Aug 18 '12 at 06:32
-
This link appears to be dead. Can you find an updated version? – templatetypedef Jul 16 '15 at 18:42
-
@templatetypedef: http://160592857366.free.fr/joe/ebooks/ShareData/An%20Optimal%20Algorithm%20for%20Selection%20in%20a%20Min-Heap.pdf – Jim Mischel Oct 31 '17 at 03:38