Re:Python 3.4.0 released
by ggchappell on Monday March 17, 2014 @06:34PM
(#7418569)
Or maybe Introselect, which does Quickselect, but switches to Median-of-Medians (i.e., BFPRT) if the recursion depth gets too big. It has the average-case performance of Quickselect, but, like M-of-M, requires only O(n) comparisons when given a list of length n.
[ Parent
| on HN ]
There are no comments on this comment yet.