Difference between revisions of "cpp/algorithm/partial sort copy"
(→Complexity: fix) |
(typo in example) |
||
| Line 58: | Line 58: | ||
std::cout << '\n' << *it << '\n'; | std::cout << '\n' << *it << '\n'; | ||
| − | it = std::partial_sort_copy(v0.begin(), v0.end(), | + | it = std::partial_sort_copy(v0.begin(), v0.end(), v2.begin(), v2.end(), |
std::greater<int>()); | std::greater<int>()); | ||
Revision as of 06:49, 4 January 2012
Template:cpp/algorithm/sidebar Template:ddcl list begin <tr class="t-dsc-header">
<td><algorithm>
<td></td> <td></td> </tr> <tr class="t-dcl ">
<td >RandomAccessIterator partial_sort_copy( InputIterator first,
InputIterator last,
RandomAccessIterator d_first,
<td > (1) </td> <td class="t-dcl-nopad"> </td> </tr> <tr class="t-dcl ">
<td >RandomAccessIterator partial_sort_copy( InputIterator first,
InputIterator last,
RandomAccessIterator d_first,
RandomAccessIterator d_last,
<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.
Contents |
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) |
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.
