< cpp‎ | algorithm
Algorithm library
Constrained algorithms and algorithms on ranges (C++20)
Constrained algorithms, e.g. ranges::copy, ranges::sort, ...
Execution policies (C++17)
Non-modifying sequence operations
Modifying sequence operations
Partitioning operations
Sorting operations
Binary search operations
Set operations (on sorted ranges)
Heap operations
Minimum/maximum operations

Numeric operations
Operations on uninitialized storage
C library
Defined in header <algorithm>
template< class BidirIt >
void reverse( BidirIt first, BidirIt last );
(until C++20)
template< class BidirIt >
constexpr void reverse( BidirIt first, BidirIt last );
(since C++20)
template< class ExecutionPolicy, class BidirIt >
void reverse( ExecutionPolicy&& policy, BidirIt first, BidirIt last );
(2) (since C++17)
1) Reverses the order of the elements in the range [first, last).
Behaves as if applying std::iter_swap to every pair of iterators first + i and (last - i) - 1 for each non-negative i < (last - first) / 2.
2) Same as (1), but executed according to policy. This overload does not participate in overload resolution unless

std::is_execution_policy_v<std::decay_t<ExecutionPolicy>> is true.

(until C++20)

std::is_execution_policy_v<std::remove_cvref_t<ExecutionPolicy>> is true.

(since C++20)


[edit] Parameters

first, last - the range of elements to reverse
policy - the execution policy to use. See execution policy for details.
Type requirements
BidirIt must meet the requirements of ValueSwappable and LegacyBidirectionalIterator.

[edit] Return value


[edit] Complexity

Exactly (last - first) / 2 swaps.

[edit] Exceptions

The overload with a template parameter named ExecutionPolicy reports errors as follows:

  • If execution of a function invoked as part of the algorithm throws an exception and ExecutionPolicy is one of the standard policies, std::terminate is called. For any other ExecutionPolicy, the behavior is implementation-defined.
  • If the algorithm fails to allocate memory, std::bad_alloc is thrown.

[edit] Notes

Implementations (e.g. MSVC STL) may enable vectorization when the iterator type satisfies LegacyContiguousIterator and swapping its value type calls neither non-trivial special member function nor ADL-found swap.

[edit] Possible implementation

See also the implementations in libstdc++, libc++, and MSVC STL.

template<class BidirIt>
constexpr // since C++20
void reverse(BidirIt first, BidirIt last)
    using iter_cat = typename std::iterator_traits<BidirIt>::iterator_category;
    // Tag dispatch, e.g. calling reverse_impl(first, last, iter_cat()),
    // can be used in C++14 and earlier modes.
    if constexpr (std::is_base_of_v<std::random_access_iterator_tag, iter_cat>)
        if (first == last)
        for (--last; first < last; (void)++first, --last)
            std::iter_swap(first, last);
        while (first != last && first != --last)
            std::iter_swap(first++, last);

[edit] Example

#include <vector>
#include <iostream>
#include <iterator>
#include <algorithm>
int main()
    std::vector<int> v{1, 2, 3};
    std::reverse(v.begin(), v.end());
    for (auto e : v)
        std::cout << e;
    std::cout << '\n';
    int a[] = {4, 5, 6, 7};
    std::reverse(std::begin(a), std::end(a));
    for (auto e : a)
        std::cout << e;



[edit] Defect reports

The following behavior-changing defect reports were applied retroactively to previously published C++ standards.

DR Applied to Behavior as published Correct behavior
LWG 223 C++98 swap was applied to each pair of iterators applies iter_swap instead

[edit] See also

creates a copy of a range that is reversed
(function template) [edit]
reverses the order of elements in a range
(niebloid) [edit]