Algorithms |
 |
An algorithm is a procedure that can be applied on all or part of a container. The bulk of STL implementation code is not dedicated to its containers, but is dedicated to its algorithms. This mirrors the goal of STL's inventors, who wanted to produce a set of library protocols and code that allow the creation of reusable algorithms.
This chapter provides an overview of algorithms, as well as the topics listed below.
- A simple example using the
minandmaxalgorithms - A discussion of algorithms and iterators
- An overview of algorithm Interfaces
- A list of algorithms by category