1、merge:将两个序列合并成一个新的序列,并对新的序列排序
原型:
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 );
示例:
#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 ;
}
2、inplace_merge:将两个序列合并成一个新的序列,并对新的序列进行归并排序(这两个序列必须要进过排序)
原型:
template <class BidirectionalIterator>
void inplace_merge ( BidirectionalIterator first, BidirectionalIterator middle,
BidirectionalIterator last );
template <class BidirectionalIterator, class Compare>
void inplace_merge ( BidirectionalIterator first, BidirectionalIterator middle,
BidirectionalIterator last, Compare comp );
示例:
#include < iostream >
#include < algorithm >
#include < vector >
using namespace std;
int main () {
int first[] = { 5 , 10 , 15 , 20 , 25 };
int second[] = { 50 , 40 , 30