19.6 ALGORITHMS
Many commonly required algorithms are supported by standard template library. It helps programmer in a great way. Few common algorithms are listed below. Readers are advised to refer to the manual of the actual STL they use. Commonly used algorithms are listed in Table 19.7
Table 19.7 Commonly Used Algorithms
| 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 ... |
Get Object Oriented Programming with C++, Second Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
