Back

The std::binary_search is a presence-check algorithm that operates on at least partially ordered ranges and provides O(logn) complexity if the range models at least random-access iteration.

The algorithm does have a range variant and supports constexpr (both since C++20); however, as might be expected, it does not have a parallel variant.

Compiler Explorer link: https://compiler-explorer.com/z/dzPPefeos