In the C++ Standard Library, the algorithms library provides various functions that perform algorithmic operations on containers and other sequences, represented by Iterators. The C++ standard provides some standard algorithms collected in the standard header. A handful of algorithms are also in the header. All algorithms are in the namespace.

Execution policies

C++17 provides the ability for many algorithms to optionally take an execution policy, which may allow implementations to execute the algorithm in parallel (i.e. by using threads or SIMD instructions). There are four different policy types, each indicating different semantics about the order in which element accesses are allowed to be observed relative to each other It is up to the user to ensure that the operations performed by the function are thread safe when using policies which may execute across different threads.

Ranges

C++20 adds versions of the algorithms defined in the header which operate on ranges rather than pairs of iterators. The ranges versions of algorithm functions are scoped within the namespace. They extend the functionality of the basic algorithms by allowing iterator-sentinel pairs to be used instead of requiring that both iterators be of the same type and also allowing interoperability with the objects provided by the ranges header without requiring the user to manually extract the iterators.

Non-modifying sequence operations

Predicate checking algorithms

Checks if a given predicate evaluates to true for some amount of objects in the range, or returns the amount of objects that do

Comparison algorithms

Compares two ranges for some property

Searching algorithms

Finds the first or last position in a range where the subsequent elements satisfy some predicate

Binary search algorithms

Provides Binary search operations on ranges. It is undefined behaviour to use these on ranges which are not sorted.

Maximum/Minimum search algorithms

Finds the maximum or minimum element in a range, as defined by some comparison predicate

Property checking algorithms

Checks if an entire range satisfies some property

Modifying sequence operations

Copying algorithms

Transfers the elements from one range into another

Partitioning algorithms

Moves the elements of a range in-place so the range is partitioned with respect to some property

Sorting algorithms

Sorts or partially sorts a range in-place

Populating algorithms

Populates a given range without reading the values contained within

Transforming algorithms

Transforms each element of a given range in-place

Reordering algorithms

Changes the order of elements within a range in-place

Heap algorithms

Provides algorithms to create, insert, and remove elements from a max heap