# Perform an in-place merge for two vectors : Vector « Data Structure « C++

Perform an in-place merge for two vectors

```#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
vector<char> vectorObject1;
int i;

for(i = 0; i <26; i+=2)
vectorObject1.push_back('A'+i);
for(i = 0; i <26; i+=2)
vectorObject1.push_back('B'+i);

cout << "Original contents of vectorObject1:\n";
for(i = 0; i <vectorObject1.size(); i++)
cout << vectorObject1[ i ];
cout << endl;

inplace_merge(vectorObject1.begin(), vectorObject1.begin()+13, vectorObject1.end());

cout << "Result of merge:\n";
for(i = 0; i <vectorObject1.size(); i++)
cout << vectorObject1[ i ];

return 0;
}

```

### Related examples in the same category

 1 Using Other Search functions 2 Matching Elements Using the equals and mismatch Operations 3 Creating and Resizing Vectors 4 Demonstrate count and count_if. 5 Demonstrate remove_copy in Vector 6 Access a vector using an iterator. 7 Demonstrate insert and erase. 8 Store a class object in a vector. 9 Demonstrate allocator's max_size() fucntion in vector 10 Demonstrate count() in vector 11 Demonstrate count_if(). 12 Demonstrate reverse in vector 13 Demonstrate insert_iterator in vector 14 Demonstrate adjacent_difference() in vector 15 Demonstrate inner_product() in vector 16 Demonstrate partial_sum() in Vector 17 Storing Class Objects with overloaded operators in a Vector 18 Vector Init Array 19 Use istream_iterator with the copy algorithm 20 Demonstrate remove_copy and replace_copy. 21 Vector: Insert Erase Sort 22 Demonstrate accumulate() in vector 23 end() in vector 24 Use pop_back() and empty(). 25 Access the elements of a vector through an iterator. 26 The basic operation of a vector: size, push_back, 27 Accessing a Vector Through an Iterator 28 Use istream_iterator to read various data types 29 Create permutations based on vector 30 Work with heaps: make_heap from vector 31 Demonstrating the four ways that vectors can be created. 32 Vector Capacity vs size 33 Using clear()