The previous chapter discusses the containers provided by the Standard Library to store data. Orthogonally to these, the library offers numerous algorithms to process this or other data. Algorithms are independent of containers: they do their work solely based on iterators and can therefore be executed on any range of elements as long as suitable iterators are provided.
This chapter starts with a brief definition of input/output iterators, followed by a detailed overview of all available algorithms organized by functionality. ...