Algorithms library

 

C++

Compiler support

Freestanding and hosted

Language

Standard library

Standard library headers

Named requirements

Feature test macros (C++20)

Language support library

Concepts library (C++20)

Metaprogramming library (C++11)

Diagnostics library

General utilities library

Strings library

Containers library

Iterators library

Ranges library (C++20)

Algorithms library

Numerics library

Localizations library

Input/output library

Filesystem library (C++17)

Regular expressions library (C++11)

Concurrency support library (C++11)

Execution support library (C++26)

Technical specifications

Symbols index

External libraries

 

Algorithm library

Constrained algorithms and algorithms on ranges (C++20)
Constrained algorithms, e.g. ranges::copy, ranges::sort, ...
Execution policies (C++17)
is_execution_policy (C++17)   execution::seqexecution::parexecution::par_unseqexecution::unseq (C++17)    (C++17)(C++17)(C++20)	execution::sequenced_policyexecution::parallel_policyexecution::parallel_unsequenced_policyexecution::parallel_unsequenced (C++17)(C++17)(C++17)(C++20)
Non-modifying sequence operations Batch operations for_each for_each_n (C++17) Search operations all_ofany_ofnone_of (C++11)                (C++11)(C++11) countcount_if mismatch equal findfind_iffind_if_not (C++11) find_end find_first_of adjacent_find search search_n Modifying sequence operations Copy operations copycopy_if (C++11) copy_backward copy_n (C++11) move (C++11) move_backward (C++11) Swap operations swap iter_swap swap_ranges Transformation operations replacereplace_if transform replace_copyreplace_copy_if Generation operations fill fill_n generate generate_n Removing operations removeremove_if unique remove_copyremove_copy_if unique_copy Order-changing operations reverse reverse_copy rotate rotate_copy random_shuffleshuffle (until C++17)(C++11) shift_leftshift_right (C++20)(C++20) Sampling operations sample (C++17)	Sorting and related operations Partitioning operations partition partition_copy (C++11)   stable_partition is_partitioned (C++11) partition_point (C++11) Sorting operations sort stable_sort partial_sort partial_sort_copy is_sorted (C++11) is_sorted_until (C++11) nth_element Binary search operations (on partitioned ranges) lower_bound upper_bound equal_range binary_search Set operations (on sorted ranges) includes set_union set_intersection set_difference set_symmetric_difference Merge operations (on sorted ranges) merge inplace_merge Heap operations push_heap pop_heap make_heap sort_heap is_heap (C++11) is_heap_until (C++11) Minimum/maximum operations max min minmax (C++11) clamp (C++17) max_element min_element minmax_element (C++11) Lexicographical comparison operations lexicographical_compare lexicographical_compare_three_way (C++20) Permutation operations next_permutation prev_permutation is_permutation (C++11) C library qsort bsearch
Numeric operations
iota (C++11) inner_product adjacent_difference    accumulate reduce (C++17) transform_reduce (C++17)	partial_sum inclusive_scan (C++17)    exclusive_scan (C++17) transform_inclusive_scan (C++17) transform_exclusive_scan (C++17)
Operations on uninitialized memory
uninitialized_copy uninitialized_move (C++17)    uninitialized_fill uninitialized_copy_n (C++11) uninitialized_move_n (C++17) uninitialized_fill_n	destroy (C++17) destroy_n (C++17) destroy_at (C++17) construct_at (C++20)       uninitialized_default_construct (C++17) uninitialized_value_construct (C++17) uninitialized_default_construct_n (C++17) uninitialized_value_construct_n (C++17)

 

The algorithms library defines functions for a variety of purposes (e.g. searching, sorting, counting, manipulating) that operate on ranges of elements. Note that a range is defined as [first, last) where last refers to the element past the last element to inspect or modify.

Constrained algorithms C++20 provides constrained versions of most algorithms in the namespace std::ranges. In these algorithms, a range can be specified as either an iterator-sentinel pair or as a single range argument, and projections and pointer-to-member callables are supported. Additionally, the return types of most algorithms have been changed to return all potentially useful information computed during the execution of the algorithm. std::vector<int> v {7, 1, 4, 0, -1}; std::ranges::sort(v); // constrained algorithm

(since C++20)

Execution policies Most algorithms have overloads that accept execution policies. The standard library algorithms support several execution policies, and the library provides corresponding execution policy types and objects. Users may select an execution policy statically by invoking a parallel algorithm with an execution policy object of the corresponding type. Standard library implementations (but not the users) may define additional execution policies as an extension. The semantics of parallel algorithms invoked with an execution policy object of implementation-defined type is implementation-defined. Parallel version of algorithms (except for std::for_each and std::for_each_n) are allowed to make arbitrary copies of elements from ranges, as long as both std::is_trivially_copy_constructible_v<T> and std::is_trivially_destructible_v<T> are true, where T is the type of elements. Defined in header <execution> Defined in namespace std::execution sequenced_policyparallel_policyparallel_unsequenced_policyunsequenced_policy (C++17)(C++17)(C++17)(C++20) execution policy types (class) seqparpar_unsequnseq (C++17)(C++17)(C++17)(C++20) global execution policy objects (constant) Defined in namespace std is_execution_policy (C++17) test whether a class represents an execution policy (class template) Feature-test macro Value Std Feature __cpp_lib_parallel_algorithm 201603L (C++17) Parallel algorithms __cpp_lib_execution 201603L (C++17) Execution policies 201902L (C++20) std::execution::unsequenced_policy

(since C++17)

Non-modifying sequence operations

Batch operations

Defined in header <algorithm>
for_each	applies a function to a range of elements (function template)
ranges::for_each (C++20)	applies a function to a range of elements (niebloid)
for_each_n (C++17)	applies a function object to the first N elements of a sequence (function template)
ranges::for_each_n (C++20)	applies a function object to the first N elements of a sequence (niebloid)

Search operations

Defined in header <algorithm>
all_ofany_ofnone_of (C++11)(C++11)(C++11)	checks if a predicate is true for all, any or none of the elements in a range (function template)
ranges::all_ofranges::any_ofranges::none_of (C++20)(C++20)(C++20)	checks if a predicate is true for all, any or none of the elements in a range (niebloid)
ranges::containsranges::contains_subrange (C++23)(C++23)	checks if the range contains the given element or subrange (niebloid)
findfind_iffind_if_not (C++11)	finds the first element satisfying specific criteria (function template)
ranges::findranges::find_ifranges::find_if_not (C++20)(C++20)(C++20)	finds the first element satisfying specific criteria (niebloid)
ranges::find_lastranges::find_last_ifranges::find_last_if_not (C++23)(C++23)(C++23)	finds the last element satisfying specific criteria (niebloid)
find_end	finds the last sequence of elements in a certain range (function template)
ranges::find_end (C++20)	finds the last sequence of elements in a certain range (niebloid)
find_first_of	searches for any one of a set of elements (function template)
ranges::find_first_of (C++20)	searches for any one of a set of elements (niebloid)
adjacent_find	finds the first two adjacent items that are equal (or satisfy a given predicate) (function template)
ranges::adjacent_find (C++20)	finds the first two adjacent items that are equal (or satisfy a given predicate) (niebloid)
countcount_if	returns the number of elements satisfying specific criteria (function template)
ranges::countranges::count_if (C++20)(C++20)	returns the number of elements satisfying specific criteria (niebloid)
mismatch	finds the first position where two ranges differ (function template)
ranges::mismatch (C++20)	finds the first position where two ranges differ (niebloid)
equal	determines if two sets of elements are the same (function template)
ranges::equal (C++20)	determines if two sets of elements are the same (niebloid)
search	searches for the first occurrence of a range of elements (function template)
ranges::search (C++20)	searches for the first occurrence of a range of elements (niebloid)
search_n	searches for the first occurrence of a number consecutive copies of an element in a range (function template)
ranges::search_n (C++20)	searches for the first occurrence of a number consecutive copies of an element in a range (niebloid)
ranges::starts_with (C++23)	checks whether a range starts with another range (niebloid)
ranges::ends_with (C++23)	checks whether a range ends with another range (niebloid)

Fold operations

Defined in header <algorithm>
ranges::fold_left (C++23)	left-folds a range of elements (niebloid)
ranges::fold_left_first (C++23)	left-folds a range of elements using the first element as an initial value (niebloid)
ranges::fold_right (C++23)	right-folds a range of elements (niebloid)
ranges::fold_right_last (C++23)	right-folds a range of elements using the last element as an initial value (niebloid)
ranges::fold_left_with_iter (C++23)	left-folds a range of elements, and returns a pair (iterator, value) (niebloid)
ranges::fold_left_first_with_iter (C++23)	left-folds a range of elements using the first element as an initial value, and returns a pair (iterator, optional) (niebloid)

Modifying sequence operations

Copy operations

Defined in header <algorithm>
copycopy_if (C++11)	copies a range of elements to a new location (function template)
ranges::copyranges::copy_if (C++20)(C++20)	copies a range of elements to a new location (niebloid)
copy_n (C++11)	copies a number of elements to a new location (function template)
ranges::copy_n (C++20)	copies a number of elements to a new location (niebloid)
copy_backward	copies a range of elements in backwards order (function template)
ranges::copy_backward (C++20)	copies a range of elements in backwards order (niebloid)
move (C++11)	moves a range of elements to a new location (function template)
ranges::move (C++20)	moves a range of elements to a new location (niebloid)
move_backward (C++11)	moves a range of elements to a new location in backwards order (function template)
ranges::move_backward (C++20)	moves a range of elements to a new location in backwards order (niebloid)

Swap operations

Defined in header <algorithm>   (until C++11)
Defined in header <utility>     (since C++11)
Defined in header <string_view>
swap	swaps the values of two objects (function template)
Defined in header <algorithm>
swap_ranges	swaps two ranges of elements (function template)
ranges::swap_ranges (C++20)	swaps two ranges of elements (niebloid)
iter_swap	swaps the elements pointed to by two iterators (function template)

Transformation operations

Defined in header <algorithm>
transform	applies a function to a range of elements, storing results in a destination range (function template)
ranges::transform (C++20)	applies a function to a range of elements (niebloid)
replacereplace_if	replaces all values satisfying specific criteria with another value (function template)
ranges::replaceranges::replace_if (C++20)(C++20)	replaces all values satisfying specific criteria with another value (niebloid)
replace_copyreplace_copy_if	copies a range, replacing elements satisfying specific criteria with another value (function template)
ranges::replace_copyranges::replace_copy_if (C++20)(C++20)	copies a range, replacing elements satisfying specific criteria with another value (niebloid)

Generation operations

Defined in header <algorithm>
fill	copy-assigns the given value to every element in a range (function template)
ranges::fill (C++20)	assigns a range of elements a certain value (niebloid)
fill_n	copy-assigns the given value to N elements in a range (function template)
ranges::fill_n (C++20)	assigns a value to a number of elements (niebloid)
generate	assigns the results of successive function calls to every element in a range (function template)
ranges::generate (C++20)	saves the result of a function in a range (niebloid)
generate_n	assigns the results of successive function calls to N elements in a range (function template)
ranges::generate_n (C++20)	saves the result of N applications of a function (niebloid)

Removing operations

Defined in header <algorithm>
removeremove_if	removes elements satisfying specific criteria (function template)
ranges::removeranges::remove_if (C++20)(C++20)	removes elements satisfying specific criteria (niebloid)
remove_copyremove_copy_if	copies a range of elements omitting those that satisfy specific criteria (function template)
ranges::remove_copyranges::remove_copy_if (C++20)(C++20)	copies a range of elements omitting those that satisfy specific criteria (niebloid)
unique	removes consecutive duplicate elements in a range (function template)
ranges::unique (C++20)	removes consecutive duplicate elements in a range (niebloid)
unique_copy	creates a copy of some range of elements that contains no consecutive duplicates (function template)
ranges::unique_copy (C++20)	creates a copy of some range of elements that contains no consecutive duplicates (niebloid)

Order-changing operations

Defined in header <algorithm>
reverse	reverses the order of elements in a range (function template)
ranges::reverse (C++20)	reverses the order of elements in a range (niebloid)
reverse_copy	creates a copy of a range that is reversed (function template)
ranges::reverse_copy (C++20)	creates a copy of a range that is reversed (niebloid)
rotate	rotates the order of elements in a range (function template)
ranges::rotate (C++20)	rotates the order of elements in a range (niebloid)
rotate_copy	copies and rotate a range of elements (function template)
ranges::rotate_copy (C++20)	copies and rotate a range of elements (niebloid)
shift_leftshift_right (C++20)	shifts elements in a range (function template)
random_shuffleshuffle (until C++17)(C++11)	randomly re-orders elements in a range (function template)
ranges::shuffle (C++20)	randomly re-orders elements in a range (niebloid)
ranges::shift_leftranges::shift_right (C++23)	shifts elements in a range (niebloid)

Sampling operations

Defined in header <algorithm>
sample (C++17)	selects N random elements from a sequence (function template)
ranges::sample (C++20)	selects N random elements from a sequence (niebloid)

Sorting and related operations

Requirements

Some algorithms require the sequence represented by the arguments to be “sorted” or “partitioned”. The behavior is undefined if the requirement is not met.

A sequence is sorted with respect to a comparator comp if for every iterator iter pointing to the sequence and every non-negative integer n such that iter + n is a valid iterator pointing to an element of the sequence, comp(*(iter + n), *iter) == false.

(until C++20)

A sequence is sorted with respect to comp and proj for a comparator comp and projection proj if for every iterator iter pointing to the sequence and every non-negative integer n such that iter + n is a valid iterator pointing to an element of the sequence, bool(std::invoke(comp, std::invoke(proj, *(iter + n)),                        std::invoke(proj, *iter))) is false. A sequence is sorted with respect to a comparator comp if the sequence is sorted with respect to comp and std::identity{} (the identity projection).

(since C++20)

A sequence [start, finish) is partitioned with respect to an expression f(e) if there exists an integer n such that for all i in [​0​, std::distance(start, finish)), f(*(start + i)) is true if and only if i < n.

Partitioning operations

Defined in header <algorithm>
is_partitioned (C++11)	determines if the range is partitioned by the given predicate (function template)
ranges::is_partitioned (C++20)	determines if the range is partitioned by the given predicate (niebloid)
partition	divides a range of elements into two groups (function template)
ranges::partition (C++20)	divides a range of elements into two groups (niebloid)
partition_copy (C++11)	copies a range dividing the elements into two groups (function template)
ranges::partition_copy (C++20)	copies a range dividing the elements into two groups (niebloid)
stable_partition	divides elements into two groups while preserving their relative order (function template)
ranges::stable_partition (C++20)	divides elements into two groups while preserving their relative order (niebloid)
partition_point (C++11)	locates the partition point of a partitioned range (function template)
ranges::partition_point (C++20)	locates the partition point of a partitioned range (niebloid)

Sorting operations

Defined in header <algorithm>
sort	sorts a range into ascending order (function template)
ranges::sort (C++20)	sorts a range into ascending order (niebloid)
stable_sort	sorts a range of elements while preserving order between equal elements (function template)
ranges::stable_sort (C++20)	sorts a range of elements while preserving order between equal elements (niebloid)
partial_sort	sorts the first N elements of a range (function template)
ranges::partial_sort (C++20)	sorts the first N elements of a range (niebloid)
partial_sort_copy	copies and partially sorts a range of elements (function template)
ranges::partial_sort_copy (C++20)	copies and partially sorts a range of elements (niebloid)
is_sorted (C++11)	checks whether a range is sorted into ascending order (function template)
ranges::is_sorted (C++20)	checks whether a range is sorted into ascending order (niebloid)
is_sorted_until (C++11)	finds the largest sorted subrange (function template)
ranges::is_sorted_until (C++20)	finds the largest sorted subrange (niebloid)
nth_element	partially sorts the given range making sure that it is partitioned by the given element (function template)
ranges::nth_element (C++20)	partially sorts the given range making sure that it is partitioned by the given element (niebloid)

Binary search operations (on partitioned ranges)

Defined in header <algorithm>
lower_bound	returns an iterator to the first element not less than the given value (function template)
ranges::lower_bound (C++20)	returns an iterator to the first element not less than the given value (niebloid)
upper_bound	returns an iterator to the first element greater than a certain value (function template)
ranges::upper_bound (C++20)	returns an iterator to the first element greater than a certain value (niebloid)
equal_range	returns range of elements matching a specific key (function template)
ranges::equal_range (C++20)	returns range of elements matching a specific key (niebloid)
binary_search	determines if an element exists in a partially-ordered range (function template)
ranges::binary_search (C++20)	determines if an element exists in a partially-ordered range (niebloid)

Set operations (on sorted ranges)

Defined in header <algorithm>
includes	returns true if one sequence is a subsequence of another (function template)
ranges::includes (C++20)	returns true if one sequence is a subsequence of another (niebloid)
set_union	computes the union of two sets (function template)
ranges::set_union (C++20)	computes the union of two sets (niebloid)
set_intersection	computes the intersection of two sets (function template)
ranges::set_intersection (C++20)	computes the intersection of two sets (niebloid)
set_difference	computes the difference between two sets (function template)
ranges::set_difference (C++20)	computes the difference between two sets (niebloid)
set_symmetric_difference	computes the symmetric difference between two sets (function template)
ranges::set_symmetric_difference (C++20)	computes the symmetric difference between two sets (niebloid)

Merge operations (on sorted ranges)

Defined in header <algorithm>
merge	merges two sorted ranges (function template)
ranges::merge (C++20)	merges two sorted ranges (niebloid)
inplace_merge	merges two ordered ranges in-place (function template)
ranges::inplace_merge (C++20)	merges two ordered ranges in-place (niebloid)

Heap operations

A random access range [first, last) is a heap with respect to a comparator comp if bool(comp(first[(i - 1) / 2], first[i])) is false for all integer i in (​0​, last - first).

(until C++20)

A random access range [first, last) is a heap with respect to comp and proj for a comparator comp and projection proj if bool(std::invoke(comp, std::invoke(proj, first[(i - 1) / 2]),                        std::invoke(proj, first[i])) is false for all integer i in (​0​, last - first). A random access range [first, last) is a heap with respect to a comparator comp if the range is a heap with respect to comp and std::identity{} (the identity projection).

(since C++20)

A heap can be created by std::make_heap and ranges::make_heap(since C++20).

For more properties of heap, see max heap.

Defined in header <algorithm>
push_heap	adds an element to a max heap (function template)
ranges::push_heap (C++20)	adds an element to a max heap (niebloid)
pop_heap	removes the largest element from a max heap (function template)
ranges::pop_heap (C++20)	removes the largest element from a max heap (niebloid)
make_heap	creates a max heap out of a range of elements (function template)
ranges::make_heap (C++20)	creates a max heap out of a range of elements (niebloid)
sort_heap	turns a max heap into a range of elements sorted in ascending order (function template)
ranges::sort_heap (C++20)	turns a max heap into a range of elements sorted in ascending order (niebloid)
is_heap (C++11)	checks if the given range is a max heap (function template)
ranges::is_heap (C++20)	checks if the given range is a max heap (niebloid)
is_heap_until (C++11)	finds the largest subrange that is a max heap (function template)
ranges::is_heap_until (C++20)	finds the largest subrange that is a max heap (niebloid)

Minimum/maximum operations

Defined in header <algorithm>
max	returns the greater of the given values (function template)
ranges::max (C++20)	returns the greater of the given values (niebloid)
max_element	returns the largest element in a range (function template)
ranges::max_element (C++20)	returns the largest element in a range (niebloid)
min	returns the smaller of the given values (function template)
ranges::min (C++20)	returns the smaller of the given values (niebloid)
min_element	returns the smallest element in a range (function template)
ranges::min_element (C++20)	returns the smallest element in a range (niebloid)
minmax (C++11)	returns the smaller and larger of two elements (function template)
ranges::minmax (C++20)	returns the smaller and larger of two elements (niebloid)
minmax_element (C++11)	returns the smallest and the largest elements in a range (function template)
ranges::minmax_element (C++20)	returns the smallest and the largest elements in a range (niebloid)
clamp (C++17)	clamps a value between a pair of boundary values (function template)
ranges::clamp (C++20)	clamps a value between a pair of boundary values (niebloid)

Lexicographical comparison operations

Defined in header <algorithm>
lexicographical_compare	returns true if one range is lexicographically less than another (function template)
ranges::lexicographical_compare (C++20)	returns true if one range is lexicographically less than another (niebloid)
lexicographical_compare_three_way (C++20)	compares two ranges using three-way comparison (function template)

Permutation operations

Defined in header <algorithm>
next_permutation	generates the next greater lexicographic permutation of a range of elements (function template)
ranges::next_permutation (C++20)	generates the next greater lexicographic permutation of a range of elements (niebloid)
prev_permutation	generates the next smaller lexicographic permutation of a range of elements (function template)
ranges::prev_permutation (C++20)	generates the next smaller lexicographic permutation of a range of elements (niebloid)
is_permutation (C++11)	determines if a sequence is a permutation of another sequence (function template)
ranges::is_permutation (C++20)	determines if a sequence is a permutation of another sequence (niebloid)

Numeric operations

Defined in header <numeric>
iota (C++11)	fills a range with successive increments of the starting value (function template)
ranges::iota (C++23)	fills a range with successive increments of the starting value (niebloid)
accumulate	sums up or folds a range of elements (function template)
inner_product	computes the inner product of two ranges of elements (function template)
adjacent_difference	computes the differences between adjacent elements in a range (function template)
partial_sum	computes the partial sum of a range of elements (function template)
reduce (C++17)	similar to std::accumulate, except out of order (function template)
exclusive_scan (C++17)	similar to std::partial_sum, excludes the ith input element from the ith sum (function template)
inclusive_scan (C++17)	similar to std::partial_sum, includes the ith input element in the ith sum (function template)
transform_reduce (C++17)	applies an invocable, then reduces out of order (function template)
transform_exclusive_scan (C++17)	applies an invocable, then calculates exclusive scan (function template)
transform_inclusive_scan (C++17)	applies an invocable, then calculates inclusive scan (function template)

Operations on uninitialized memory

Defined in header <memory>
uninitialized_copy	copies a range of objects to an uninitialized area of memory (function template)
ranges::uninitialized_copy (C++20)	copies a range of objects to an uninitialized area of memory (niebloid)
uninitialized_copy_n (C++11)	copies a number of objects to an uninitialized area of memory (function template)
ranges::uninitialized_copy_n (C++20)	copies a number of objects to an uninitialized area of memory (niebloid)
uninitialized_fill	copies an object to an uninitialized area of memory, defined by a range (function template)
ranges::uninitialized_fill (C++20)	copies an object to an uninitialized area of memory, defined by a range (niebloid)
uninitialized_fill_n	copies an object to an uninitialized area of memory, defined by a start and a count (function template)
ranges::uninitialized_fill_n (C++20)	copies an object to an uninitialized area of memory, defined by a start and a count (niebloid)
uninitialized_move (C++17)	moves a range of objects to an uninitialized area of memory (function template)
ranges::uninitialized_move (C++20)	moves a range of objects to an uninitialized area of memory (niebloid)
uninitialized_move_n (C++17)	moves a number of objects to an uninitialized area of memory (function template)
ranges::uninitialized_move_n (C++20)	moves a number of objects to an uninitialized area of memory (niebloid)
uninitialized_default_construct (C++17)	constructs objects by default-initialization in an uninitialized area of memory, defined by a range (function template)
ranges::uninitialized_default_construct (C++20)	constructs objects by default-initialization in an uninitialized area of memory, defined by a range (niebloid)
uninitialized_default_construct_n (C++17)	constructs objects by default-initialization in an uninitialized area of memory, defined by a start and a count (function template)
ranges::uninitialized_default_construct_n (C++20)	constructs objects by default-initialization in an uninitialized area of memory, defined by a start and count (niebloid)
uninitialized_value_construct (C++17)	constructs objects by value-initialization in an uninitialized area of memory, defined by a range (function template)
ranges::uninitialized_value_construct (C++20)	constructs objects by value-initialization in an uninitialized area of memory, defined by a range (niebloid)
uninitialized_value_construct_n (C++17)	constructs objects by value-initialization in an uninitialized area of memory, defined by a start and a count (function template)
ranges::uninitialized_value_construct_n (C++20)	constructs objects by value-initialization in an uninitialized area of memory, defined by a start and a count (niebloid)
destroy (C++17)	destroys a range of objects (function template)
ranges::destroy (C++20)	destroys a range of objects (niebloid)
destroy_n (C++17)	destroys a number of objects in a range (function template)
ranges::destroy_n (C++20)	destroys a number of objects in a range (niebloid)
destroy_at (C++17)	destroys an object at a given address (function template)
ranges::destroy_at (C++20)	destroys an object at a given address (niebloid)
construct_at (C++20)	creates an object at a given address (function template)
ranges::construct_at (C++20)	creates an object at a given address (niebloid)

Random number generation

Defined in header <random>
ranges::generate_random (C++26)	fills a range with random numbers from a uniform random bit generator (niebloid)

Notes

Feature-test macro	Value	Std	Feature
__cpp_lib_algorithm_iterator_requirements	202207L	(C++23)	Ranges iterators as inputs to non-Ranges algorithms
__cpp_lib_clamp	201603L	(C++17)	std::clamp
__cpp_lib_constexpr_algorithms	201806L	(C++20)	Constexpr for algorithms
	202306L	(C++26)	Constexpr stable sorting
__cpp_lib_algorithm_default_value_type	202403L	(C++26)	List-initialization for algorithms
__cpp_lib_freestanding_algorithm	202311L	(C++26)	Freestanding facilities in <algorithm>
__cpp_lib_robust_nonmodifying_seq_ops	201304L	(C++14)	Making non-modifying sequence operations more robust (two-range overloads for std::mismatch, std::equal and std::is_permutation)
__cpp_lib_sample	201603L	(C++17)	std::sample
__cpp_lib_shift	201806L	(C++20)	std::shift_left and std::shift_right

C library

Defined in header <cstdlib>
qsort	sorts a range of elements with unspecified type (function)
bsearch	searches an array for an element of unspecified type (function)

Defect reports

The following behavior-changing defect reports were applied retroactively to previously published C++ standards.

DR	Applied to	Behavior as published	Correct behavior
LWG 193	C++98	heap required *first to be the largest element	there can be elements equal to *first
LWG 2150	C++98	the definition of a sorted sequence was incorrect	corrected
LWG 2166	C++98	the heap requirement did not match the definition of max heap closely enough	requirement improved

See also

C documentation for Algorithms