C++ Reference Material
The STL Algorithms Classified by Optional Function Parameter
Note that in the following tables the only algorithm that appears in two different places is transform, the reason being that it has one version that takes a binary predicate and another that takes a unary predicate.
| binary predicate | unary predicate |
|---|---|
|
adjacent_find binary_search equal equal_range find_end find_first_of includes inplace_merge lexicographical_compare lower_bound make_heap max max_element merge min min_element mismatch next_permutation nth_element partial_sort partial_sort_copy pop_heap prev_permutation push_heap search search_n set_difference set_intersection set_symmetric_difference set_union sort sort_heap stable_sort unique unique_copy upper_bound |
count_if find_if partition remove_copy_if remove_if replace_copy_if replace_if stable_partition |
| binary functions | unary functions |
|---|---|
|
accumulate adjacent_difference inner_product partial_sum transform |
for_each generate generate_n random_shuffle transform |
|
copy copy_backward count fill fill_n find iter_swap remove remove_copy replace replace_copy reverse reverse_copy rotate rotate_copy swap swap_ranges |