Algorithm - 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);

의미)

오름차순으로 정렬된 데이터인 [Iterator first1, Iterator last1)사이의 데이터 들과 [Iterator first2, Iterator last2)사이의 데이터 들을 합쳐서 Iterator result가 가리키는 위치 부터 삽입합니다. 중복데이터들은 개수 만큼 따로 표기합니다. 

소스)

#include<iostream>
#include<algorithm>
#include<vector>
 
void Print(const std::vector<int>& target)
{
    for (std::vector<int>::const_iterator iterPos = target.cbegin(); iterPos != target.cend(); iterPos++)
        std::cout << *iterPos << " ";
    std::cout << std::endl;
}
 
void main()
{
    std::vector<int> vector = { 10,5,20,15,30 };
    std::vector<int> vector2 = { 1,3,5,7,9,11 };
    std::vector<int> vectorMerge(11);
 
    std::sort(vector.begin(), vector.end());
    std::sort(vector2.begin(), vector2.end());
    std::vector<int>::iterator iter = std::merge(vector.begin(), vector.end(), vector2.begin(), vector2.end(), vectorMerge.begin());
    Print(vectorMerge);
    if (iter != vectorMerge.end())
        std::cout << "this itertaor not point end" << std::endl;
}
 

리턴값)

합쳐진 데이터가 삽인된  Container의 end()를 가리키는 Iterator를 리턴합니다.

결과)