<\/p>\n

Input iterator<\/h2>\n

\n
• They have limited functionality and weakest of all iterators.<\/li>\n
• In single-pass algorithms it can be used.<\/li>\n
• Those algorithms which process the container sequentially, such that no element is accessed more than once.<\/li>\n<\/ul>\n

  Output iterator<\/h2>\n

  \n
  • It is also like input operators, they are also very limited in their functionality and can only be used in single-pass algorithm, but not for accessing elements, but for being assigned elements.<\/li>\n<\/ul>\n

    Forward iterator<\/h2>\n

    \n
    • It is higher in hierarchy than input iterator and output iterator and contain all the features present in these two iterators<\/li>\n
    • As name suggests, they can also only move in a forward direction and that too one step at a time.<\/li>\n<\/ul>\n

      Bidirectional iterator<\/h2>\n

      \n
      • It has all the features of forward iterators along with the fact that they overcome the drawback of forward iterators, in both the directions they can move, hence their name is Bidirectional iterators.<\/li>\n<\/ul>\n

        Random Access iterator<\/h2>\n

        \n
        • It is the most powerful iterators and they are not limited to moving sequentially, as their name suggests, they can randomly access any element inside the container.<\/li>\n<\/ul>\n

          Sample Code<\/strong><\/h3>\n

          <\/div>

          #include <iostream>\u00a0\u00a0\u00a0 #include <vector>\u00a0\u00a0\u00a0 using namespace std;\u00a0\u00a0\u00a0 int main()\u00a0\u00a0\u00a0 {\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\/\/ Declaring a vector\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 vector<int> v = { 1, 2, 3 };\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \/\/ Declaring an iterator\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 vector<int>::iterator i;\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 int j;\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 cout << "Without iterators = ";\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \/\/ Accessing the elements without using iterators\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 for (j = 0; j < 3; ++j)\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 {\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 cout << v[j] << " ";\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 cout << "\\nWith iterators = ";\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \/\/ Accessing the elements using iterators\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0for (i = v.begin(); i != v.end(); ++i)\u00a0\u00a0\u00a0 \u00a0\u00a0{\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0cout << *i << " ";\u00a0\u00a0\u00a0 \u00a0\u00a0}\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \/\/ Adding one more element to vector\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 v.push_back(4);\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 cout << "\\nWithout iterators = ";\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \/\/ Accessing the elements without using iterators\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 for (j = 0; j < 4; ++j)\u00a0\u00a0\u00a0 \u00a0{\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 cout << v[j] << " ";\u00a0\u00a0 \u00a0\u00a0}\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 cout << "\\nWith iterators = ";\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0\/\/ Accessing the elements using iterators\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0for (i = v.begin(); i != v.end(); ++i)\u00a0\u00a0\u00a0\u00a0{\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0cout << *i << " ";\u00a0\u00a0\u00a0\u00a0}\u00a0\u00a0\u00a0\u00a0return 0;\u00a0 }<\/code><\/pre> <\/div>\n
          Output<\/strong><\/h3>\n
          <\/p>\n
          \u00a0<\/strong><\/p>\n","protected":false},"excerpt":{"rendered":"
          An iterator is an object like a pointer that points to an element inside the container. Iterator can use to move through the contents of the container. We can access the content at that particular location using them and it can be visualized as something similar to a pointer pointing to some location. It plays […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"passster_activate_protection":false,"passster_protect_child_pages":"","passster_protection_type":"password","passster_password":"","passster_activate_overwrite_defaults":"","passster_headline":"","passster_instruction":"","passster_placeholder":"","passster_button":"","passster_id":"","passster_activate_misc_settings":"","passster_redirect_url":"","passster_hide":"no","passster_area_shortcode":"","gtb_hide_title":false,"gtb_wrap_title":false,"gtb_class_title":"","gtb_remove_headerfooter":false,"footnotes":""},"categories":[2080],"tags":[18380,18379,18376,18373,18382,18375,18377,18374,18381,18378],"class_list":["post-4777","post","type-post","status-publish","format-standard","hentry","category-cpp","tag-auto-iterator-c","tag-c-iterator-implementation","tag-c-iterators","tag-introduction-to-iterators-in-c","tag-iterator-arithmetic-c","tag-iterators","tag-iterators-c-example","tag-iterators-in-c","tag-list-iterator-c","tag-types-of-iterators-in-c"],"yoast_head":"\n