From: Sam Schetterer (samthecppman_at_[hidden])
Date: 2007-03-16 15:53:20
On March 16, 2007, Hans Larsen hans_at_[hidden] wrote
Maybe finding the nth element of an array, without actually sorting
the array. This could be useful for finding 2nd min/max and median
of an array reusing the same algorithm.
This is actually quite easy, and may have already been implemented in
boost or stl (but i haven't found it yet). It's a similar technique
to quicksort, except you only aim at finding an element and you care
not about the side of the pivot that is not interesting. It is O((log
What you think?
Ok. I will implementn those functions and post them to ault as soon as
Boost list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk