One important part of the standard template library (STL) is a set of generic functions, supplied by the header
<algorithm>, that help manipulate or work with the contents of a container. In this lesson, you will learn about using different STL algorithms and customizing them to your needs.
Finding, searching, removing, and counting are some generic algorithmic activities that find application in a broad range of programs. STL solves these and many other requirements in the form of generic template functions that work on containers via iterators. To use STL algorithms, the programmer first has to include the header,
Although most algorithms work via iterators on containers, not ...