inplace_merge, reverse_copy, and unique_copy. : inplace_merge « STL Algorithms Merge « C++ Tutorial






#include <iostream>
#include <algorithm>
#include <vector>
#include <iterator>

using namespace std;

int main()
{
   const int SIZE = 10;
   int a1[ SIZE ] = { 1, 3, 5, 7, 9, 1, 3, 5, 7, 9 };
   vector< int > v1( a1, a1 + SIZE );

   inplace_merge( v1.begin(), v1.begin() + 5, v1.end() );
   
   vector< int > results1;
   unique_copy( v1.begin(), v1.end(), back_inserter( results1 ) );
   
   vector< int > results2;
   reverse_copy( v1.begin(), v1.end(), back_inserter( results2 ) );

   cout << endl;
   return 0;
}








28.2.inplace_merge
28.2.1.std::inplace_merge
28.2.2.inplace_merge a list
28.2.3.Generic merge algorithms: Merge the two sorted halves of vector3 in place to obtain a sorted vector3
28.2.4.inplace_merge, reverse_copy, and unique_copy.