Difference between revisions of "cpp/algorithm/partial sort"
m (r2.7.3) (Robot: Adding de, es, fr, it, ja, pt, zh) |
(add "see also" entry for nth_element) |
||
| Line 54: | Line 54: | ||
===See also=== | ===See also=== | ||
{{dcl list begin}} | {{dcl list begin}} | ||
| + | {{dcl list template | cpp/algorithm/dcl list nth_element}} | ||
{{dcl list template | cpp/algorithm/dcl list partial_sort_copy}} | {{dcl list template | cpp/algorithm/dcl list partial_sort_copy}} | ||
{{dcl list template | cpp/algorithm/dcl list stable_sort}} | {{dcl list template | cpp/algorithm/dcl list stable_sort}} | ||
Revision as of 10:02, 9 November 2012
Template:ddcl list begin <tr class="t-dsc-header">
<td><algorithm>
<td></td> <td></td> </tr> <tr class="t-dcl ">
<td >void partial_sort( RandomIt first, RandomIt middle, RandomIt last );
<td > (1) </td> <td class="t-dcl-nopad"> </td> </tr> <tr class="t-dcl ">
<td >void partial_sort( RandomIt first, RandomIt middle, RandomIt last, Compare comp );
<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 middle - first of these elements are placed in the range [first, middle). The order of equal elements is not guaranteed to be preserved. The order of the remaining elements in the range [middle, last) is unspecified. The first version uses operator< to compare the elements, the second version uses the given comparison function comp.
Contents |
Parameters
| 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) |
| Type requirements | ||
-RandomIt must meet the requirements of ValueSwappable and LegacyRandomAccessIterator.
| ||
-The type of dereferenced RandomIt must meet the requirements of MoveAssignable and MoveConstructible.
| ||
Return value
(none)
Complexity
O(N·log2(N)), where N = std::distance(first, last) applications of cmp. If additional memory is available, then the complexity is O(N·log(N))
Example
#include <algorithm> #include <functional> #include <array> #include <iostream> int main() { std::array<int, 10> s{5, 7, 4, 2, 8, 6, 1, 9, 0, 3}; std::partial_sort(s.begin(), s.begin() + 3, s.end()); for (int a : s) { std::cout << a << " "; } }
Output:
0 1 2 7 8 6 5 9 4 3
