Difference between revisions of "cpp/algorithm/inplace merge"
(→Example: formatting) |
(→Complexity: formatting) |
||
| Line 33: | Line 33: | ||
===Complexity=== | ===Complexity=== | ||
| − | {{ | + | Exctly {{math|N-1}} comparisons if enough additional memory is available, otherwise {{math|N·log(N)}} where {{cpp|1=N = std::distance(first, last)}}. |
===Example=== | ===Example=== | ||
Revision as of 12:20, 31 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 inplace_merge( BidirectionalIterator first,
BidirectionalIterator middle,
<td > (1) </td> <td class="t-dcl-nopad"> </td> </tr> <tr class="t-dcl ">
<td >void inplace_merge( BidirectionalIterator first,
BidirectionalIterator middle,
BidirectionalIterator last,
<td > (2) </td> <td class="t-dcl-nopad"> </td> </tr> Template:ddcl list end
Merges two consecutive sorted ranges [first, middle) and [middle, last) into one sorted range [first, last). 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 | - | the beginning of the first sorted range |
| middle | - | the end of the first sorted range and the beginning of the second |
| last | - | the end of the second sorted 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
Complexity
Exctly N-1 comparisons if enough additional memory is available, otherwise N·log(N) where Template:cpp.
