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

Home
C++
1.Bitset
2.Class
3.Console
4.Data Structure
5.Data Type
6.Deque
7.Development
8.File
9.Function
10.Generic
11.Language
12.List
13.Map Multimap
14.Overload
15.Pointer
16.Qt
17.Queue Stack
18.Set Multiset
19.STL Algorithms Binary search
20.STL Algorithms Heap
21.STL Algorithms Helper
22.STL Algorithms Iterator
23.STL Algorithms Merge
24.STL Algorithms Min Max
25.STL Algorithms Modifying sequence operations
26.STL Algorithms Non modifying sequence operations
27.STL Algorithms Sorting
28.STL Basics
29.String
30.Valarray
31.Vector
C / ANSI-C
C Tutorial
C++ Tutorial
Visual C++ .NET
C++ » STL Algorithms Merge » inplace_mergeScreenshots 
std::inplace_merge
 
 

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

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

int main()
{
   const int SIZE = 10;
   int a1SIZE 135791357};
   std::vector< int > v1a1, a1 + SIZE )// copy of a
   std::ostream_iterator< int > outputcout, " " );

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

   std::inplace_mergev1.begin(), v1.begin() 2, v1.end() );

   cout << "\nAfter inplace_merge, v1 contains: ";
   std::copyv1.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 
 */        
  
Related examples in the same category
1.inplace_merge a list
2.Generic merge algorithms: Merge the two sorted halves of vector3 in place to obtain a sorted vector3
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.