#include<iostream>
#include<algorithm>
#include<vector>
#include<iterator>
using std::cout;
using std::endl;
int main()
{
const int SIZE = 5;
int a1[SIZE] = { 1, 3, 5, 7, 9 };
int a2[SIZE] = { 2, 4, 5, 7, 9 };
std::vector<int> v1( a1, a1 + SIZE );
std::vector<int> v2( a2, a2 + SIZE );
std::ostream_iterator<int> outputIt( cout, " " );
cout<< "Vector v1 contains: ";
std::copy( v1.begin(), v1.end(), outputIt );
cout<<"/nVector v2 contains: ";
std::copy( v2.begin(), v2.end(), outputIt );
std::vector< int > results( v1.size() );
std::copy_backward( v1.begin(), v1.end(), results.end() );
cout<<"/n/nAfter copy_backward, results contains: ";
std::copy( results.begin(), results.end(), outputIt );
std::vector< int > results2( v1.size() + v2.size() );
std::merge( v1.begin(), v1.end(), v2.begin(), v2.end(), results2.begin() );
cout<<"/n/nAfter merge of v1 and v2 result2 contains:/n";
std::copy( results2.begin(), results2.end(), outputIt );
std::vector< int >::iterator endLocation;
endLocation = std::unique( results2.begin(), results2.end() );
cout<<"/n/nAfter unique results2 contains:/n";
std::copy( results2.begin(), endLocation, outputIt );
cout<<"/n/nVector v1 after reverse: ";
std::reverse( v1.begin(), v1.end() );
std::copy( v1.begin(), v1.end(), outputIt );
cout<<endl;
return 0;
}