Apache C++ Standard Library Reference Guide

## 2.9 Algorithms library

Clause 25 of the Standard contains the Algorithms library, `lib.algorithms`. This library describes components for performing algorithmic operations on containers and other sequences. If you are reading this manual online, click the name of header file or entry to go to its description.

#### Table 8: Algorithms library

Header File | Corresponding Entries in this Reference
`<algorithm>` | Algorithms `for_each()` `find()` `find_if()` `find_end()` `find_first_of()` `adjacent_find()` `count()`, `count_if()` `mismatch()` `equal()` `search()`, `search_n()` `copy()`, `copy_backward()` `swap()` `swap_ranges()` `iter_swap()` `transform()` `replace()` `replace_if()` `replace_copy()` `replace_copy_if()` `fill()`, `fill_n()` `generate()`, `generate_n()` `remove()` `remove_if()` `remove_copy()` `remove_copy_if()` `unique()`, `unique_copy()` `reverse()` `reverse_copy()` `rotate()`, `rotate_copy()` | `random_shuffle()` `partition()` `stable_partition()` `sort()` `stable_sort()` `partial_sort()` `partial_sort_copy()` `nth_element()` `lower_bound()` `upper_bound()` `equal_range()` `binary_search()` `merge()` `inplace_merge()` `includes()` `set_union()` `set_intersection()` `set_difference()` `set_symmetric_difference()` `push_heap()` `pop_heap()` `make_heap()` `sort_heap()` `min()` `max()` `min_element()` `max_element()` `lexicographical_compare()` `next_permutation()` `prev_permutation()`