// value we‘ll look forint search_value = http://www.mamicode.com/42;// call find to see if that value is presentvector<int>::const_iterator result =    find(vec.begin(), vec.end(), search_value);    // report the resultcout << "The value " << search_value    << (result == vec.end() ? " is not present" : " is present")    << endl;

// call find to look through elements in a listlist<int>::const_iterator result =    find(lst.begin(), lst.end(), search_value);cout << "The value " << search_value    << (result == lst.end() ? " is not present" : " is present")    << endl;

int ia[6] = {27, 210, 12, 47, 109, 83};int search_value = http://www.mamicode.com/83;int *result = find(ia, ia + 6, search_value);cout << "The value " << search_value    << (result == ia + 6 ? " is not present" : " is present")    << endl;

#include <algorithm>

#include <numeric>

// sum the elements in vec starting the summation with the value 42int sum = accumulate(vec.begin(), vec.end(), 42);

// program for illustration purposes only:// there are much faster ways to solve this problemsize_t cnt = 0;list<string>::iterator it = roster1.begin();// look in roster1 for any name also in roster2while ((it = find_first_of(it, roster1.end(),    roster2.begin(), roster2.end()))!= roster1.end()) {    ++cnt;    // we got a match, increment it to look in the rest of roster1    ++it;}cout << "Found " << cnt    << " names on both rosters" << endl;

fill(vec.begin(), vec.end(), 0); // reset each element to 0// set subsequence of the range to 10fill(vec.begin(), vec.begin() + vec.size()/2, 10);

vector<int> vec; // empty vector// disaster: attempts to write to 10 (nonexistent) elements in vecfill_n(vec.begin(), 10, 0);

vector<int> vec; // empty vector// ok: back_inserter creates an insert iterator that adds elements to vecfill_n (back_inserter(vec), 10, 0); // appends 10 elements to vec

vector<int> ivec; // empty vector// copy elements from ilst into iveccopy (ilst.begin(), ilst.end(), back_inserter(ivec));

// better way to copy elements from ilstvector<int> ivec(ilst.begin(), ilst.end());

// replace any element with value of 0 by 42replace(ilst.begin(), ilst.end(), 0, 42);

// create empty vector to hold the replacementvector<int> ivec;// use back_inserter to grow destination as neededreplace_copy (ilst.begin(), ilst.end(),　　　　back_inserter(ivec), 0, 42);

// sort words alphabetically so we can find the duplicatessort(words.begin(), words.end());/* eliminate duplicate words:* unique reorders words so that each word appears once in the* front portion of words and returns an iterator one past theunique range;* erase uses a vector operation to remove the nonunique elements*/vector<string>::iterator end_unique = unique(words.begin(), words.end());words.erase(end_unique, words.end());

// comparison function to be used to sort by word lengthbool isShorter(const string &s1, const string &s2){    return s1.size() < s2.size();}

// determine whether a length of a given word is 6 or morebool GT6(const string &s){    return s.size() >= 6;}

// sort words by size, but maintain alphabetic order for words of the same sizestable_sort(words.begin(), words.end(), isShorter);

vector<string>::size_type wc =　　count_if(words.begin(), words.end(), GT6);

// position an iterator into ilstlist<int>::iterator it = find (ilst.begin(), ilst.end(), 42);// insert replaced copies of ivec at that point in ilstreplace_copy (ivec.begin(), ivec.end(),inserter (ilst, it), 100, 0);

istream_iterator<int> cin_it(cin); // reads ints1 from cinistream_iterator<int> end_of_stream; // end iterator value// writes Sales_items from the ofstream named outfile// each element is followed by a spaceofstream outfile;ostream_iterator<Sales_item> output(outfile, " ");

istream_iterator<int> in_iter(cin); // read ints from cinistream_iterator<int> eof; // istream "end" iterator// read until end of file, storing what was read in vecwhile (in_iter != eof)// increment advances the stream to the next value// dereference reads next value from the istream    vec.push_back(*in_iter++);

// write one string per line to the standard outputostream_iterator<string> out_iter(cout, "\n");// read strings from standard input and the end iteratoristream_iterator<string> in_iter(cin), eof;// read until eof and write what was read to the standard outputwhile (in_iter != eof)// write value of in_iter to standard output// and then increment the iterator to get the next value from cin    *out_iter++ = *in_iter++;

istream_iterator<int> cin_it(cin); // reads ints from cinistream_iterator<int> end_of_stream; // end iterator value// initialize vec from the standard input:vector<int> vec(cin_it, end_of_stream);sort(vec.begin(), vec.end());// writes ints to cout using " " as the delimiterostream_iterator<int> output(cout, " ");// write only the unique elements in vec to the standard outputunique_copy(vec.begin(), vec.end(), output);

vector<int> vec;for (vector<int>::size_type i = 0; i != 10; ++i)    vec.push_back(i); // elements are 0,1,2,...9

// reverse iterator of vector from back to frontvector<int>::reverse_iterator r_iter;for (r_iter = vec.rbegin(); // binds r_iter to last element    r_iter != vec.rend(); // rend refers 1 before 1st element    ++r_iter) // decrements iterator one element    cout << *r_iter << endl; // prints 9,8,7,...0

sort (beg, end); // use < operator to sort the elementssort (beg, end, comp); // use function named comp to sort the elements

reverse(beg, end);reverse_copy(beg, end, dest);