May 2012
Intermediate to advanced
679 pages
16h 56m
English
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 ... |
Read now
Unlock full access