# Use std::copy_backward to place elements in one vector into another vector in reverse order : copy_backward « STL Algorithms Modifying sequence operations « 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++ » STL Algorithms Modifying sequence operations » copy_backward Screenshots
Use std::copy_backward to place elements in one vector into another vector in reverse order
 ```    #include  using std::cout; using std::endl; #include  #include  #include  int main() {    int a1[ 5 ] = { 1, 3, 5, 7, 9 };    int a2[ 5 ] = { 2, 4, 5, 7, 9 };        std::vector< int > v1( a1, a1 + 5 );    std::vector< int > v2( a2, a2 + 5 );        std::ostream_iterator< int > output( cout, " " );    std::copy( v1.begin(), v1.end(), output ); // display vector output    std::copy( v2.begin(), v2.end(), output ); // display vector output    std::vector< int > results( v1.size() );    // place elements of v1 into results in reverse order    std::copy_backward( v1.begin(), v1.end(), results.end() );    cout << "\n\nAfter copy_backward, results contains: ";    std::copy( results.begin(), results.end(), output );        cout << endl;    return 0; } /* 1 3 5 7 9 2 4 5 7 9 After copy_backward, results contains: 1 3 5 7 9 */           ```
Related examples in the same category
 1 Use the copy_backward algorithms: Shift it right by 2 positions