Menu
×
   ❮     
HTML CSS JAVASCRIPT SQL PYTHON JAVA PHP HOW TO W3.CSS C C++ C# BOOTSTRAP REACT MYSQL JQUERY EXCEL XML DJANGO NUMPY PANDAS NODEJS R TYPESCRIPT ANGULAR GIT POSTGRESQL MONGODB ASP AI GO KOTLIN SASS VUE DSA GEN AI SCIPY CYBERSECURITY DATA SCIENCE
     ❯   

C++ Tutorial

C++ HOME C++ Intro C++ Get Started C++ Syntax C++ Output C++ Comments C++ Variables C++ User Input C++ Data Types C++ Operators C++ Strings C++ Math C++ Booleans C++ If...Else C++ Switch C++ While Loop C++ For Loop C++ Break/Continue C++ Arrays C++ Structures C++ Enums C++ References C++ Pointers

C++ Functions

C++ Functions C++ Function Parameters C++ Function Overloading C++ Scope C++ Recursion

C++ Classes

C++ OOP C++ Classes/Objects C++ Class Methods C++ Constructors C++ Access Specifiers C++ Encapsulation C++ Inheritance C++ Polymorphism C++ Files C++ Exceptions C++ Date

C++ Data Structures

C++ Data Structures & STL C++ Vectors C++ List C++ Stacks C++ Queues C++ Deque C++ Sets C++ Maps C++ Iterators C++ Algorithms

C++ How To

C++ Add Two Numbers C++ Random Numbers

C++ Reference

C++ Reference C++ Keywords C++ <iostream> C++ <fstream> C++ <cmath> C++ <string> C++ <cstring> C++ <ctime> C++ <vector> C++ <algorithm>

C++ Examples

C++ Examples C++ Real-Life Examples C++ Compiler C++ Exercises C++ Quiz C++ Syllabus C++ Study Plan C++ Certificate


C++ algorithm reverse_copy() function

❮ Algorithm Functions


Example

Create a copy of a vector with the elements in reverse order:

vector<int> numbers = {1, 3, 5, 7, 2, 9};
vector<int> newnumbers(6);
reverse_copy(numbers.begin(), numbers.end(), newnumbers.begin());
for (int number : newnumbers) {
  cout << number << " ";
}
Try it Yourself »

Definition and Usage

The reverse_copy() function creates a copy of a data range with the elements in reverse order.

The range of data is specified by iterators.

Syntax

reverse_copy(iterator start, iterator end, iterator destination);

Parameter Values

Parameter Description
start Required. An iterator pointing to the start of the data range.
end Required. An iterator pointing to the end of the data range. Elements up to this position will be included, but the element at this position will not be.
deatination Required. An iterator pointing to the start of the data range that the data will be copied to.

Technical Details

Returns: An iterator pointing to the end of the destination data range.

Related Pages

Read more about data structures in our Data Structures Tutorial.

Read more about iterators in our Iterators Tutorial.

Read more about algorithms in our Algorithms Tutorial.


❮ Algorithm Functions