std::inplace_merge : inplace_merge « STL Algorithms Merge « C++ Tutorial






#include <iostream>
using std::cout;
using std::endl;

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

int main()
{
   const int SIZE = 10;
   int a1[ SIZE ] = { 1, 3, 5, 7, 9, 1, 3, 5, 7, 9 };
   std::vector< int > v1( a1, a1 + SIZE ); // copy of a
   std::ostream_iterator< int > output( cout, " " );

   cout << "Vector v1 contains: ";
   std::copy( v1.begin(), v1.end(), output );

   std::inplace_merge( v1.begin(), v1.begin() + 2, v1.end() );

   cout << "\nAfter inplace_merge, v1 contains: ";
   std::copy( v1.begin(), v1.end(), output );

   return 0;
}
Vector v1 contains: 1 3 5 7 9 1 3 5 7 9
After inplace_merge, v1 contains: 1 3 5 7 9 1 3 5 7 9








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.