Merge in place : merge « STL Algorithms Merge « C++

1. C++
2. STL Algorithms Merge
3. merge

Merge in place

  
#include <iostream>
#include <vector>
#include <deque>
#include <list>
#include <algorithm>

using namespace std;

template<class InIter>
void show_range(const char *msg, InIter start, InIter end);

int main()
{
  vector<char> v;
  deque<char> dq;
  list<char> result(26);
  list<char>::iterator res_end;

  for(int i=0; i < 26; i+=2) {
     v.push_back('A'+i);
  }
  for(int i=0; i < 26; i+=2) {
     dq.push_back('B'+i);
  }
  vector<char> v2;
  for(int i=0; i < 26; i+=2) {
    v2.push_back('B'+i);
  }
  for(int i=0; i < 26; i+=2) {
    v2.push_back('A'+i);
  }
  show_range("Original contents of v2:", v2.begin(), v2.end());

  return 0;
}

template<class InIter>
void show_range(const char *msg, InIter start, InIter end) {

  InIter itr;

  cout << msg << endl;

  for(itr = start; itr != end; ++itr)
    cout << *itr << endl;
}
  
    
  

Related examples in the same category