^#

transform_inclusive_scan

1↓I,∥F First, Arg 1↓O,∥F aR, uT O(N) ∥ 20

^#

transform_exclusive_scan

1↓I,∥F Arg 1↓O,∥F aR, uT O(N) ∥ 20

^#

partial_sum

1↓I First 1↓O A plus O(N), =(N - 1) Fwd. 30

^#

inclusive_scan

1↓I,∥F First, Arg 1↓O,∥F aR plus O(N) ∥ 30

^#

exclusive_scan

1↓I,∥F Arg 1↓O,∥F aR plus O(N) ∥ 30

^#

adjacent_difference

1s↓I,∥F Quasi 1↓O,∥F fD minus O(N), =(N - 1) Fwd., ∥ adjacent_transform 40

^#

adjacent_transform▸

1s↓I Quasi 1↓O D O(N), =(N - 1) Fwd., ∥ adjacent_difference 40

^#

adjacent_inclusive_scan▸

1s↓I First 1↓O A, D O(N) Fwd. 50

^#

transform

1↓I,∥F / 2↓I,∥F 1↓O,∥F uT / bT =(N) ∥ 60

^#

copy

1↓I,∥F 1↓O,∥F =(N) Fwd., ∥ transform 60

^#

copy_backward

1↓B 1↓B =(N) Rev. 60

^#

copy_n

1↓I,∥F 1↓O,∥F =(N) Unspc., ∥ transform 60

^#

replace_copy

1↓I,∥F+Value Arg 1↓O,∥F equal_to =(N) Fwd., ∥ transform 60

^#

replace_copy_if

1↓I,∥F Arg 1↓O,∥F uP =(N) Fwd., ∥ transform 60

^#

reverse_copy

1↓B 1↓O,∥F =(N) ∥ transform 60

^#

rotate_copy

1d↓F 1↓O,∥F O(N) ∥ 60

^#

move (algorithm)

1↓I,∥F 1↓O,∥F =(N) Fwd., ∥ shift_left 65

^#

move_backward

1↓B 1↓B =(N) Rev. shift_right 65

^#

shift_left

1d↓F Self "≤(N-n)" Fwd., ∥ move (algorithm) 67

^#

shift_right

1d↓F(swap),B Self "≤(N-n)" Yes, ∥ move_backward 67

^#

sample

1↓F Arg(URBG) 1↓O+Size O(N) Fwd. 70

^#

sampleⓈ

1↓I Arg(URBG) 1↓R+Size O(N) Fwd. 70

^#

partial_sort_copy

1↓I,∥F 1↓R bP less O(N log(min(D,N)) ∥ 70

^#

partition_copy

1↓I,∥F 2↓O,∥F uP =(N) Fwd., ∥ 73

^#

transform_if

1↓I 1↓O uP, uT O(N) Fwd. 75

^#

copy_if, remove_copy_if

1↓I,∥F 1↓O,∥F uP O(N) Fwd., ∥ transform_if 75

^#

remove_copy

1↓I,∥F+Value 1↓O,∥F equal_to =(N) Fwd., ∥ transform_if 75

^#

unique_copy

1↓I,∥F First 1↓O,∥F bP equal_to O(N) Fwd., ∥ 75

^#

set_difference, set_intersection, set_symmetric_difference, set_union

2↓I,∥F 1↓O,∥F bP less O(N+M), ≤(2⋅(N+M)−1) Fwd., ∥ 77

^#

merge

2↓I,∥F 1↓O,∥F bP less O(N+M) Fwd., ∥ 77

^#

regex_replace⧫

2↓B 1↓O Regex⧫ Unspc. See note⧫ 78

^#

search_replace_copy

3↓F 1↓O bP equal_to O(N×(S+R)) regex_replace⧫ 78

^#

generate, generate_n

0 1↓F G =(N) Fwd., ∥ 100

^#

iota

0 Arg 1↓F ++ =(N) Fwd. generate 100

^#

iota

0 Arg 1↓F uT ++ =(N) Fwd. generate 100

^#

fill, fill_n

0 Arg 1↓F =(N) Fwd., ∥ generate, generate_n 100

^#

for_each, for_each_n

1↓I,∥F 0∅ muT =(N) Fwd., ∥ 140

^#

for_each, for_each_n

1↓I / 2↓I 0∅ muT / mbT =(N) Fwd. 140

^#

swap_ranges

2↓F Self swap O(N) Fwd., ∥ for_each 140

^#

remove

1↓F+Value Self equal_to O(N) Fwd., ∥ 150

^#

remove_if

1↓F Self uP O(N) Fwd., ∥ 150

^#

unique

1↓F Self bP equal_to O(N) Fwd., ∥ 150

^#

replace

1↓F+Value Self equal_to =(N) Fwd., ∥ transform 160

^#

replace_if

1↓F Self uP =(N) Fwd., ∥ transform 160

^#

reverse

1↓B Self O(N), =(N/2) Yes, ∥ swap_ranges 170

^#

rotate

1d↓F Self O(N) Yes, ∥ 170

^#

shuffle

1↓R Acc(URBG) Self O(N) 170

^#

next_permutation, prev_permutation

1↓B Self O(N), ≤(N/2) 170

^#

partition

1↓F Self uP O(N); O(N log N)↓∥ ∥ 170

^#

stable_partition

1↓B Self uP O(N) w/ memory, else O(N log N); O(N log N)↓∥ ∥ 170

^#

sort

1↓R Self bP less O(N log N) ∥ 170

^#

partial_sort

1d↓R Self bP less O(N log M) ∥ 170

^#

stable_sort

1↓R Self bP less O(N log N) w/ memory, else O(N log(N)²) ∥ 170

^#

nth_element

1d↓R Self bP less O(N); O(N log N)↓∥ ∥ 170

^#

nth_elements, multi_nth_element

1↓R+positions↓R Self bP less O(N log M) nth_element 170

^#

make_heap

1↓R Self bP less O(N), ≤(3N) 170

^#

push_heap, pop_heap

1↓R Self bP less O(log N) 170

^#

sort_heap

1↓R Self bP less O(N log N) 170

^#

inplace_merge

1d↓B Self bP less =(N-1) w/ memory, O(N log N); O(N log N)↓∥ ∥ 170