Difference between revisions of "cpp/algorithm/stable sort"
(→Complexity: use {{math}} for O notation) |
|||
| Line 25: | Line 25: | ||
===Complexity=== | ===Complexity=== | ||
| − | + | {{math|O(N·log<sup>2</sup>(N))}}, where {{cpp|1=N = std::distance(first, last)}} applications of {{tt|cmp}}. If additional memory is available, then the complexity is {{math|O(N·log(N)}}. | |
===Example=== | ===Example=== | ||
Revision as of 09:27, 24 August 2011
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 >void stable_sort( RandomAccessIterator first, RandomAccessIterator last );
<td > (1) </td> <td class="t-dcl-nopad"> </td> </tr> <tr class="t-dcl ">
<td >void stable_sort( RandomAccessIterator first, RandomAccessIterator last, Compare comp );
<td > (2) </td> <td class="t-dcl-nopad"> </td> </tr> Template:ddcl list end
Sorts the elements in the range [first, last) in ascending order. 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 |
| 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
Complexity
O(N·log2(N)), where Template:cpp applications of cmp. If additional memory is available, then the complexity is O(N·log(N).
