On Mon, Jun 6, 2011 at 3:15 PM, Alex Ter-Sarkissov <ater1...@gmail.com> wrote: > I have a vector of positive integers length n. Is there a simple (i.e. > without sorting/ranking) of 'pulling out' k larrgest (or smallest) values.
Maybe not so simple, but does not require sorting (and its associated o(NlogN) cost): http://en.wikipedia.org/wiki/Selection_algorithm _______________________________________________ NumPy-Discussion mailing list NumPy-Discussion@scipy.org http://mail.scipy.org/mailman/listinfo/numpy-discussion
