The quick-select algorithm is a really simple and effective way of selecting the... | Hacker News

Hacker News new | past | comments | ask | show | jobs | submit

login

stromhold on March 3, 2010 | parent | context | favorite | on: Damn Cool Algoritms: BK-Trees

The quick-select algorithm is a really simple and effective way of selecting the k-th smallest element and one that would be nice to cover. It's especially useful in situations where you need O(n) selection of the median element.

eru on March 4, 2010 [–]

Yes. And you can unify quick-select and tree-sort (i.e. quicksort, but not in-place) in a lazy language easily in the same algorithm.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact