Editing Standard Template Library (section)

=== Algorithms ===
A large number of algorithms to perform activities such as searching and sorting are provided in the STL, each implemented to require a certain level of iterator (and therefore will work on any container that provides an interface by iterators). Searching algorithms like {{Cpp|binary_search}} and {{Cpp|lower_bound}} use [[Binary search algorithm|binary search]] and like sorting algorithms require that the type of data must implement comparison operator {{Cpp|<}} or custom comparator function must be specified; such comparison operator or comparator function must guarantee [[strict weak ordering]]. Apart from these, algorithms are provided for making heap from a range of elements, generating lexicographically ordered permutations of a range of elements, merge sorted ranges and perform [[Union (set theory)|union]], [[Intersection (set theory)|intersection]], [[Set difference|difference]] of sorted ranges.