Standard C++ Library Class Reference

partial_sort set_union
partial_sort_copy sort
partition sort_heap
prev_permutation stable_partition
push_heap stable_sort
pop_heap swap
random_shuffle swap_ranges
remove transform
remove_copy unique
remove_copy_if unique_copy
Note that the library provides both in place and copy versions of many algorithms, such as
replace and replace_copy. The library also provides versions of algorithms that allow the use of
default comparators and comparators supplied by the user. Often these functions are
overloaded, but in some cases (where overloading proved impractical or impossible) the names
differ (e.g., replace, which will use equality to determine replacement, and replace_if, which
accesses a user provided compare function).
Algorithms by Operation
We can further distinguish algorithms by the kind of operations they perform. The following
lists all algorithms by loosely grouping them into similar operations.
Initializing operations
fill generate
fill_n generate_n
Search operations
adjacent_find find_end search_n
count find_if
count_if find_first_of
find search
Binary search operations (Elements must be sorted)
binary_search lower_bound
equal_range upper_bound
Compare operations
equal mismatch
lexicographical_compare
Copy operations