devxlogo

Locate an Element of a Container Using the find() Algorithm

Locate an Element of a Container Using the find() Algorithm

You can use the generic algorithm find() to locate an element of a container. The find() algorithm takes three arguments. The first two are iterators that point at the beginning and the end of the sequence, respectively. The third argument is the sought after value. The find() algorithm returns an iterator pointing to the first element that is identical to the sought after value. If find() cannot locate the requested value, it returns an iterator pointing one element past the final element in the sequence (that is, it returns the same value as end() does). For example:

 #include  //  definition of find()#include #include using namespace std;int main(){  list lc;  lc.push_back('A');  lc.push_back('T');  lc.push_back('L');  list::iterator p = find(lc.begin(), lc.end(), 'A');   // find 'A'  if (p != lc.end())     // was A found?     *p = 'S';    // replace 'A' with 'S'	  while (p != lc.end())    //display the modified list	  cout<<*p++;}
See also  Small Business Strategies with Venmo
devxblackblue

About Our Editorial Process

At DevX, we’re dedicated to tech entrepreneurship. Our team closely follows industry shifts, new products, AI breakthroughs, technology trends, and funding announcements. Articles undergo thorough editing to ensure accuracy and clarity, reflecting DevX’s style and supporting entrepreneurs in the tech sphere.

See our full editorial policy.

About Our Journalist