inner_product 2 Arg Value A, bT plus, multiplies Unspc. Fwd. transform_reduce 10 adjacent_reduce▸ 1s Arg Value A, bT Unspc. Fwd. inner_product 10 transform_reduce 1 / 2 Arg Value acR, uT / bT plus, multiplies O(N) ∥ 20 find 1+Value Position equal_to O(N) S/C∥ 70 find_if, find_if_not 1 Position uP O(N) S/C∥ 70 find_first_of 2 Position bP equal_to O(S×N) S/C∥ find_if 70 min_element, max_element 1 First Position bP less O(N), =(max(N-1, 0)) Fwd.∥ 72 minmax_element 1 First 2 Positions⌖ bP less O(N), ≤(max(floor((3/2)*(N−1)), 0)) Fwd.∥ 72 lower_bound, upper_bound 1+Value Position bP less O(log N) + O(1)↓R; O(N) B/S 75 equal_range 1+Value Range⌖ bP less O(log N) + O(1)↓R; O(N) B/S 75 search 2 Position bP equal_to ≤(S×N) ∥ 80 find_end 2 Position bP equal_to ≤(S×(N-S+1)) ∥ search 80 starts_with 2 bool bP equal_to N > S ? O(S) : O(1)↓R; O(min(S, N)) Fwd. 80 ends_with 2 bool bP equal_to N > S ? O(S) : O(1)↓R; O(min(S, N)) 80 ranges::starts_with, ranges::ends_with 2 bool bP, uT, uTΔ equal_to, identity, identity ≤(min(S, N)) 80 search (C++17) 1 Position Searcher Depends on Searcher 85 find_match 2 Position⌖ bP equal_to O(N), O(min(N, M)) S/C 90 mismatch 2 Position⌖ bP equal_to O(N), O(min(N, M)) S/C∥ find_match 90 adjacent_find 1s Position bP equal_to =(min((result-first)+1, (last-first)-1)); O(N)↓∥ S/C∥ find_match 90 is_sorted_until 1s Position bP less O(N) S/C∥ find_match 90 search_n 1 + Count + Value Position bP equal_to ≤(N) ∥ adjacent_find 95 accumulate 1 Arg Value A plus Unspc.; O(N) Fwd. 110 sum 1 First Value R plus O(N) Fwd. accumulate 110 reduce 1 Arg Value acR plus O(N) ∥ 110 count 1+Value 0 size_t equal_to =(N) Fwd.∥ accumulate 110 count_if 1 0 size_t uP =(N) Fwd.∥ accumulate 110 binary_search 1+Value bool bP less O(log N) + O(1)↓R; O(N) B/S 110 is_partitioned 1 bool uP O(N) Fwd.∥ 120 is_sorted 1 bool bP less O(N) Fwd.∥ 120 is_heap 1 bool bP less O(N) ∥ 120 is_permutation 2 bool bP equal_to N==M ? O(N²) : O(1)↓R; O(N²) 120 includes 2 bool bP less O(N+M), ≤(2×(N+M-1)) Fwd.∥ 120 first_result 1+Value / 2+Value Arg Value uT / bT O(N) S/C 125 first_result_if 1 / 2 Value uT / bT, uP / bP O(N) S/C 125 all_of, none_of 1 true bool uP O(N) S/C∥ first_result 125 any_of 1 false bool uP O(N) S/C∥ first_result 125 contains 1+Value false bool equal_to O(N) S/C first_result 125 contains_any 2 false bool contains O(S×N) S/C first_result 125 equal 2 bool bP equal_to N==M ? ≤(N) : O(1)↓R; ≤(N); O(N)↓∥ Fwd.∥ first_result 125 lexicographical_compare 2 bool bP less ≤(2×min(N, M)) Fwd.∥ first_result 125 lexicographical_compare_three_way 2 ordering CompareΔ compare_three_way <(min(N, M)) Fwd. first_result 125 partition_point 1 Position uP O(log N)↓R; O(N) B/S 130 is_heap_until 1 Position bP less O(N) ∥ 130