1
2
3
4
5
6
7
8

template <class BidirectionalIterator>void reverse (BidirectionalIterator first, BidirectionalIterator last){while ((first!=last)&&(first!=--last)) {    std::iter_swap (first,last);    ++first;  }}

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21

// reverse algorithm example#include <iostream>// std::cout#include <algorithm>// std::reverse#include <vector>// std::vectorint main () {  std::vector<int> myvector;// set some values:for (int i=1; i<10; ++i) myvector.push_back(i);// 1 2 3 4 5 6 7 8 9  std::reverse(myvector.begin(),myvector.end());// 9 8 7 6 5 4 3 2 1// print out content:  std::cout <<"myvector contains:";for (std::vector<int>::iterator it=myvector.begin(); it!=myvector.end(); ++it)    std::cout <<' ' << *it;  std::cout <<'\n';return 0;}

myvector contains: 9 8 7 6 5 4 3 2 1