std::partial_sort_copy

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 InputIterator, class RandomAccessIterator >

RandomAccessIterator partial_sort_copy( InputIterator first,
                                        InputIterator last,
                                        RandomAccessIterator d_first,

                                        RandomAccessIterator d_last );

</td>

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

<td >

template< class InputIterator, class RandomAccessIterator, class Compare >

RandomAccessIterator partial_sort_copy( InputIterator first,
                                        InputIterator last,
                                        RandomAccessIterator d_first,
                                        RandomAccessIterator d_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. At most Template:cpp of the elements are moved to the range [d_first, d_first + n) and then sorted. n is the number of elements to sort (Template:cpp). The order of equal elements is guaranteed to be preserved. The first version uses Template:cpp to compare the elements, the second version uses the given comparison function comp.

Parameters

first, last	-	the range of elements to sort
d_first, d_last	-	random access iterators defining the destination range
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.

Return value

an iterator to the element defining the upper boundary of the sorted range, i.e. Template:cpp.

Complexity

O(N·log(min(D,N)), where Template:cpp, Template:cpp applications of cmp.

See also

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