accumulate adjacent_difference advance binary_search copy copy_backward count count_if equal equal_range fill fill_n find find_end find_first_of find_if adjacent_find for_each generate generate_n includes inner_product iota inplace_merge iter_swap lexicographical_ - compare lower_bound make_heap max max_element merge min min_element mismatch next_permutation nth_element Home      C++      Intro      Algorithms      partial_sort partial_sort_copy partial_sum partition pop_heap power prev_permutation push_heap random_shuffle remove remove_copy remove_copy_if remove_if replace replace_copy replace_copy_if replace_if reverse reverse_copy rotate rotate_copy search search_n set_difference set_intersection set_symmetric_dif- ference set_union sort sort_heap stable_partition stable_sort swap swap_ranges transform unique unique_copy upper_bound