algorithm header
From Cppwiki
- The correct title of this page is "<algorithm> header". The displayed title is incorrect for technical or other reasons.
algorithm is a C++ Standard Library #include. Itdefines various template functions.
Functions defined by <algorithm>
std::adjacent_find std::binary_search std::copy std::copy_backward std::count std::count_if std::equal std::equal_range std::fill std::fill_n std::fine std::find_end std::find_first_of std::find_if std::for_each std::generate std::generate_n std::includes std::inplace_merge std::iter_swap std::lexicographical_compare std::lower_cound std::make_heap std::max std::max_element std::merge std::min std::min_element std::mismatch std::next_permutation std::nth_element std::partial_sort std::partial_sort_copy std::partition std::pop_heap std::prev_permutation std::push_heap std::random_shuffle std::remove std::remove_copy std::remove_copy_if std::remove_if std::replace std::replace_copy std::replace_copy_if std::replace_if std::reverse std::reverse_copy std::rotate std::rotate_copy std::search std::search_n std::set_difference std::set_intersection std::set_symmeteric_difference std::set_union std::sort std::sort_heap std::stable_partition std::stable_sort std::swap std::swap_ranges std::transform std::unique std::unique_copy std::upper_bound