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

Home
C++ Tutorial
1.Language Basics
2.Data Types
3.Operators statements
4.Array
5.Development
6.Exceptions
7.Function
8.Structure
9.Class
10.Operator Overloading
11.Pointer
12.File Stream
13.template
14.STL Introduction
15.string
16.vector
17.list
18.bitset
19.set multiset
20.valarray
21.queue stack
22.deque
23.map multimap
24.STL Algorithms Modifying sequence operations
25.STL Algorithms Non modifying sequence operations
26.STL Algorithms Binary search
27.STL Algorithms Sorting
28.STL Algorithms Merge
29.STL Algorithms Min Max
30.STL Algorithms Iterator
31.STL Algorithms Heap
32.STL Algorithms Helper
C / ANSI-C
C Tutorial
C++
Visual C++ .NET
C++ Tutorial » STL Algorithms Modifying sequence operations » rotate 
24.18.7.Right-rotate a sequence by using reverse iterators with the rotate() algorithm.
#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;
}
24.18.rotate
24.18.1.Use the generic rotate algorithm
24.18.2.Use rotate to rotate one element to the left
24.18.3.Use rotate to rotate two elements to the right
24.18.4.Use rotate to rotate so that element with value 4 is the beginning
24.18.5.Rotate left two places
24.18.6.Rotate a vector: Rotate left one position
24.18.7.Right-rotate a sequence by using reverse iterators with the rotate() algorithm.
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.