[Boost-users] Finding the n smallest items in a list

Subject: [Boost-users] Finding the n smallest items in a list
From: Ruediger Berlich (ruediger.berlich_at_[hidden])
Date: 2009-02-04 06:58:41

Hi there,

I'm searching for a method to find the n smallest numbers in a list of m >>
n numbers. The n numbers need to be sorted. m will usually be in the range
of 100-1000, n will be 5 or less. So far I'm simply sorting the entire
vector, which I assume is not very efficient, as the other m-n items in the
container can remain unsorted. Is there a function in Boost that can help
me in this situation ?

Best Regards,
Ruediger