std::partial_sort

Template:cpp/algorithm/sidebar Template:ddcl list begin <tr class="t-dsc-header">

<td>

Defined in header <algorithm>

</td>

<td></td> <td></td> </tr> <tr class="t-dcl ">

<td >

template< class RandomAccessIterator >

void partial_sort( RandomAccessIterator first,
                   RandomAccessIterator middle,

                   RandomAccessIterator last );

</td>

<td > (1) </td> <td class="t-dcl-nopad"> </td> </tr> <tr class="t-dcl ">

<td >

template< class RandomAccessIterator, class Compare >

void partial_sort( RandomAccessIterator first,
                   RandomAccessIterator middle,

                   RandomAccessIterator last, Compare comp );

</td>

<td > (2) </td> <td class="t-dcl-nopad"> </td> </tr> Template:ddcl list end

Sorts some of the elements in the range [first, last) in ascending order. The first Template:cpp of these elements are placed in the range [first, middle). The order of equal elements is guaranteed to be preserved. The order of the remaining elements in the range [middle, last) is unspecified. The first version uses Template:cpp to compare the elements, the second version uses the given comparison function comp.

first, last	-	the range of elements to sort
comp	-	comparison function object (i.e. an object that satisfies the requirements of Compare) which returns true if the first argument is less than the second. The signature of the comparison function should be equivalent to the following: bool cmp(const Type1& a, const Type2& b); While the signature does not need to have const&, the function must not modify the objects passed to it and must be able to accept all values of type (possibly const) Type1 and Type2 regardless of value category (thus, Type1& is not allowed, nor is Type1 unless for Type1 a move is equivalent to a copy(since C++11)). The types Type1 and Type2 must be such that an object of type RandomAccessIterator can be dereferenced and then implicitly converted to both of them.

O(N*log²(N)), where Template:cpp applications of cmp. If additional memory is available, then the complexity is O(N*log(N))

Template:example cpp Template:cpp/algorithm/dcl list partial sort copyTemplate:cpp/algorithm/dcl list stable sortTemplate:cpp/algorithm/dcl list sort