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

1.	Language Basics
2.	Data Types
3.	Operators statements
4.	Array
5.	Development
6.	Exceptions
7.	Function
8.	Structure
9.	Class
10.	Operator Overloading
11.	Pointer
12.	File Stream
13.	template
14.	STL Introduction
15.	string
16.	vector
17.	list
18.	bitset
19.	set multiset
20.	valarray
21.	queue stack
22.	deque
23.	map multimap
24.	STL Algorithms Modifying sequence operations
25.	STL Algorithms Non modifying sequence operations
26.	STL Algorithms Binary search
27.	STL Algorithms Sorting
28.	STL Algorithms Merge
29.	STL Algorithms Min Max
30.	STL Algorithms Iterator
31.	STL Algorithms Heap
32.	STL Algorithms Helper

C / ANSI-C

C Tutorial

C++

Visual C++ .NET

C++ Tutorial » STL Algorithms Merge » inplace_merge

28.2.4.inplace_merge, reverse_copy, and unique_copy.

#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.

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.