The std::find algorithm searches for a value inside a given range. If the algorithm is successful, it returns the iterator position of the element found. If the algorithm fails, it returns the end of the range passed as second argument.

Passing function objects instead of ordinary functions to an algorithm often results in better performance. 

std::for_each is the only algorithm that can return a function object.

Function objects cannot be passed as arguments to STL algorithms.

The function std::advance can be used to increment the position of an iterator passed as an argument.

Given an object c instantiated from an STL container Cont::<T>, the expression std::cbegin(c) returns a value of type Cont<T>::const_iterator.

Function objects can only be used with algorithm std::for_each.

std::map containers store key/value pairs as elements in a sorted order based on their key values.

A binary function object takes one argument.

A std::forward_list container supports bi-directional iteration.

A unary function object takes two arguments.

Passing function objects instead of ordinary functions to an algorithm is more advantageous because function objects can have state. 

The std::transform algorithm can be used to apply a function to each element of a sequence and store the result [from the function] in the same sequence.

Given iterator iter that points to an element of a container of type std::forward_list<T>, the expression std::prev(iter) will return an iterator to the element preceding the element pointed to by iter.

A function object is an instance of a class that defines a member function operator() with the appropriate parameter types.