Re:Helping a stranger, and why you should understand NP-comp...
by ggchappell on Monday November 04, 2013 @05:02PM
(#6671498)
I'm familiar with the median-of-medians linear-time selection algorithm (a.k.a. BFPRT). But I don't recall ever seeing a construction of a pivot-finding algorithm using de-randomization. Do you have a reference for this?
[ Parent
| on HN ]
Re:Helping a stranger, and why you should understand NP-comp...
by eru on Tuesday November 05, 2013 @12:15AM
(#6673353)
Sorry, that was from memory. (Can't you interpret the BFPRT as a de-randomization?)
Anyway, slightly modified my point still stands: BFPRT is way more complicated (and harder to come up with) than randomized QuickSelect.