copy_backward, merge, unique and reverse. : copy_backward « STL Algorithms Non modifying sequence operations « 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 Non modifying sequence operations » copy_backward

25.3.4.copy_backward, merge, unique and reverse.

#include <iostream>

#include <algorithm>

#include <vector>



using namespace std;



int main()

{

   const int SIZE = 5;

   int a1[ SIZE ] = { 1, 3, 5, 7, 9 };

   int a2[ SIZE ] = { 2, 4, 5, 7, 9 };

   vector< int > v1( a1, a1 + SIZE );

   vector< int > v2( a2, a2 + SIZE );



   vector< int > results( v1.size() );

   copy_backward( v1.begin(), v1.end(), results.end() );

   

   vector< int > results2( v1.size() + v2.size() );

   merge( v1.begin(), v1.end(), v2.begin(), v2.end(),results2.begin() );

   

   vector< int >::iterator endLocation;

   endLocation = unique( results2.begin(), results2.end() );



   reverse( v1.begin(), v1.end() );



   cout << endl;

   return 0;

}

25.3.copy_backward
	25.3.1.	Use the copy_backward algorithms: Shift it right by 2 positions
	25.3.2.	Use std::copy_backward to place elements in one vector into another vector in reverse order
	25.3.3.	Use copy_backward to copy value from vector to a list
	25.3.4.	copy_backward, merge, unique and reverse.

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.