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

의미)

[Iterator first, Iterator midddle) 사이와 [Iterator middle, Iterator last) 사이의 연속된 2개의 오름차순 정렬된 범위에 대해서 Iterator result를가 가리키는위치 부터  [Iterator first, Iterator last)의 모든 데이터를 병합하여 정렬하여 삽입니다.

소스)

#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::vector<int>::iterator iter;
 
    std::sort(vector.begin(), vector.end());
    std::sort(vector2.begin(), vector2.end());
    Print(vector);
    Print(vector2);
 
    iter = std::copy(vector.begin(), vector.end(), vectorMerge.begin());
    Print(vectorMerge);
    std::copy(vector2.begin(), vector2.end(), iter);
    Print(vectorMerge);
 
    std::inplace_merge(vectorMerge.begin(), vectorMerge.begin() + 5, vectorMerge.end());
    Print(vectorMerge);
}
 

리턴값)

없음

결과)