frederickson1993optimal (404B)
1 # frederickson1993optimal 2 3 Presents an [algorithm] the k smallest elements of a [min_heap] in O(k), when k is much smaller than the size of the heap 4 - the elements are not [sorted] 5 - in fact according to [gawrychowski2024revisiting] Lemma 5.4 we can even get the k-th element 6 - which then makes it easy to get the k smallest elements 7 8 Up: [academic_paper] about [heap] 9 10 See also: [selection_algorithm]