Right-rotate a sequence by using reverse iterators with the rotate() algorithm. : rotate « STL Algorithms Modifying sequence operations « C++ Tutorial

1. C++ Tutorial
2. STL Algorithms Modifying sequence operations
3. rotate

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

void show(const char *msg, vector<int> vect);

int main(){
  vector<int> v;

  for(int i=0; i<10; i++) 
     v.push_back(i);

  show("Original order: ", v);

  rotate(v.rbegin(), v.rbegin()+2, v.rend());

  show("Order after two right-rotates: ", v);

  return 0;
}

void show(const char *msg, vector<int> vect) {
  cout << msg << endl;
  for(unsigned i=0; i < vect.size(); ++i)
    cout << vect[i] << endl;
}