# reverse iterator and find : reverse_iterator « STL Algorithms Iterator « 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++ Tutorial » STL Algorithms Iterator » reverse_iterator
30.6.1.reverse iterator and find
 #include  #include  #include  #include  using namespace std; int main(int argc, char** argv) {   vector myVector;   myVector.push_back(1);   myVector.push_back(2);   myVector.push_back(3);   myVector.push_back(4);   myVector.push_back(5);   int num = 3;   vector::iterator it1;   vector::reverse_iterator it2;   it1 = find(myVector.begin(), myVector.end(), num);   it2 = find(myVector.rbegin(), myVector.rend(), num);   if (it1 != myVector.end()) {     cout << num << " : position " << it1 - myVector.begin() << " going forward.\n";     cout << num << " : position " << it2.base() - 1 - myVector.begin() << " going backward.\n";   } else {     cout << "Failed to find " << num << endl;   }   return (0); }
 30.6.reverse_iterator 30.6.1. reverse iterator and find 30.6.2. Use a reverse_iterator to go from the end to the beginning