The C++ function std::algorithm::copy_backward() copies a range of elements to a new location in backward order.
DeclarationFollowing is the declaration for std::algorithm::copy_backward() function form std::algorithm header.
C++98template <class BidirectionalIterator1, class BidirectionalIterator2> BidirectionalIterator2 copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last, BidirectionalIterator2 result);Parameters
first − Bidirectional iterators to the initial positions in a sequence.
last − Bidirectional iterators to the final positions in a sequence.
result − Bidirectional iterator to the past-the-end position in the destination sequence.
Returns an iterator to the first element of the destination sequence where elements have been copied.
ExceptionsThrows an exception if either element assignment or an operation on an iterator throws exception.
Please note that invalid parameters cause undefined behavior.
Time complexityLinear in the distance between first to last.
ExampleThe following example shows the usage of std::algorithm::copy_backward() function.
#include <iostream> #include <vector> #include <algorithm> using namespace std; int main(void) { vector<int> v1 = {1, 2, 3, 4, 5}; vector<int> v2(5); copy_backward(v1.begin(), v1.end(), v2.end()); cout << "Vector v2 contains following elements" << endl; for (auto it = v2.begin(); it != v2.end(); ++it) cout << *it << endl; return 0; }
Let us compile and run the above program, this will produce the following result −
Vector v2 contains following elements 1 2 3 4 5
algorithm.htm
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4