Parallel algorithms (since C++17) A parallel algorithm is a function template in the algorithms library with a template parameter named ExecutionPolicy or constrained by execution-policy (since C++26). …

C89/C90 standard (ISO/IEC 9899:1990): 4.10.5 Searching and sorting utilities

What links here Related changes Upload file Special pages Printable version Permanent link Page information

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 …

In the algorithm library, some function templates construct and destroy objects in uninitialized memory buffers. They are declared and defined in <memory>. Helper templates

Basic linear algebra algorithms are based on the dense Basic Linear Algebra Subroutines (BLAS) which corresponds to a subset of the BLAS Standard. These algorithms that access the elements of arrays …

// mostly freestanding #include <initializer_list> namespace std { namespace ranges { // algorithm result types template<class I, class F> struct in_fun_result; template<class I1, class I2> struct in_in_result; …

These algorithms cannot be used with associative containers such as std::set and std::map because their iterator types do not dereference to MoveAssignable types (the keys in these containers are not …

These instances are used to specify the execution policy of parallel algorithms, i.e., the kinds of parallelism allowed. Additional execution policies may be provided by a standard library …

Exceptions The overloads with a template parameter named ExecutionPolicy report errors as follows: If execution of a function invoked as part of the algorithm throws an exception and ExecutionPolicy is …