|
<algorithm>
template <class InputIterator1, class InputIterator2, class OutputIterator>
OutputIterator merge ( InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
OutputIterator result );
template <class InputIterator1, class InputIterator2,
class OutputIterator, class Compare>
OutputIterator merge ( InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
OutputIterator result, Compare comp );
Merge sorted ranges
Combines the elements in the sorted ranges [first1,last1) and [first2,last2), into a new range beginning at result with its elements sorted. The comparison for sorting uses either operator< for the first version, or comp for the second.
For the function to yield the expected result, the elements in the both ranges shall already be ordered according to the same strict weak ordering criterion (operator< or comp). The resulting range is also sorted according to it.
The behavior of this function template is equivalent to:
1
2
3
4
5
6
7
8
9
10
11
|
template <class InputIterator1, class InputIterator2, class OutputIterator>
OutputIterator merge ( InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
OutputIterator result )
{
while (true) {
*result++ = (*first2<*first1)? *first2++ : *first1++;
if (first1==last1) return copy(first2,last2,result);
if (first2==last2) return copy(first1,last1,result);
}
}
|
Parameters
- first1, last1
- Input iterators to the initial and final positions of the first sequence. The range used is [first1,last1), which contains all the elements between first1 and last1, including the element pointed by first1 but not the element pointed by last1.
- first2, last2
- Input iterators to the initial and final positions of the second sequence. The range used is [first2,last2).
- result
- Output iterator to the initial position of the range where the resulting combined range is stored. Its length is equal to the addition of the lengths of both previous ranges.
- comp
- Comparison function object that, taking two values of the same type than those contained in the range, returns true if the first argument goes before the second argument in the specific strict weak ordering it defines, and false otherwise.
Return value
An iterator pointing to the past-the-end element in the resulting sequence.
Example
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
|
// merge algorithm example
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main () {
int first[] = {5,10,15,20,25};
int second[] = {50,40,30,20,10};
vector<int> v(10);
vector<int>::iterator it;
sort (first,first+5);
sort (second,second+5);
merge (first,first+5,second,second+5,v.begin());
cout << "The resulting vector contains:";
for (it=v.begin(); it!=v.end(); ++it)
cout << " " << *it;
cout << endl;
return 0;
}
|
Output:
The resulting vector contains: 5 10 10 15 20 20 25 30 40 50
|
Complexity
At most, performs count1+count2-1 assignments and comparisons or applications of comp (where countX is the distance between firstX and lastX).
See also
| inplace_merge | Merge consecutive sorted ranges (function template) |
| set_union | Union of two sorted ranges (function template) |
| copy | Copy range of elements (function template) |
|