[SciPy-User] get best few of many: argsort( few= ) using std::partial_sort ?
Thu Jul 8 13:19:12 CDT 2010
On Thu, Jul 8, 2010 at 11:14 AM, Anne Archibald
> Just to complicate the issue somewhat, it might be valuable to have
> both k-largest and k-smallest; also, one should think about what
> happens to NaNs and infinities. Further, it might be worth including a
> fast median calculation (i.e. find the median element(s) without
> completely sorting the array).
I should have mentioned the name of the ticket: median in average O(n) time.
More information about the SciPy-User