From: Hans Larsen (hans_at_[hidden])
Date: 2007-03-16 17:06:54
On 16-Mar-07, at 4:42 PM, Michael Fawcett wrote:
> On 3/16/07, 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).
> std::nth_element perhaps?
Not exactly. nth_element merely takes the pivot that you give and
put it into place.
What I'm looking at is a function that, given a position, returns the
element that correspond to that position when array is sorted.
template< class V >
V::value_type& get_median( V& vec )
return boost::sorting::__func__( vec.begin(), vec.end(), vec.size
() / 2 );
> --Michael Fawcett
> Unsubscribe & other changes: http://lists.boost.org/mailman/
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk