[SciPy-User] get best few of many: argsort( few= ) using std::partial_sort ?
Fri Jul 9 09:33:06 CDT 2010
you've probably seen http://www.sgi.com/tech/stl/partial_sort.html
sort uses the introsort algorithm and partial_sort uses heapsort
introsort is usually faster by a factor of 2 to 5
Heapsort fans: the normal pivot selector (without medians) is blind;
trying for a pivot near a small k/n percentile is fun.
Any comments on argsort( few= ) vs a separate partial_sort() ?
More information about the SciPy-User