<algorithm>


adjacent_find

binary_search

copy

copy_backward

count

count_if

equal

equal_range

fill

fill_n

find

find_end

find_first_of

find_if

for_each

generate

generate_n

includes

inplace_merge

iter_swap

lexicographical_compare

lower_bound

make_heap

max

max_element

merge

min

min_element

mismatch

next_permutation

nth_element

partial_sort

partial_sort_copy

partition

pop_heap

prev_permutation

push_heap

random_shuffle

remove

remove_copy

remove_copy_if

remove_if

replace

replace_copy

replace_copy_if

replace_if

reverse

reverse_copy

rotate

rotate_copy

search

search_n

set_difference

set_intersection

set_symmetric_difference

set_union

sort

sort_heap

stable_partition

stable_sort

swap

swap_ranges

transform

unique

unique_copy

upper_bound