hash_set
hash_multiset
hash_map
hash_multimap
these are not standards
stl
multimap
multiset
stl algorithm depends on container's iterator
stl searching algorithm
adajcent_find
binary_search
lower_bound upper_bound
search
copy copy_backward; reverse order copy
count
count_if
min_element max_element
equal equal_range
mismatch
lexicographic_compare
fill fill_n
generate vs fill generate_n vs fill_n: funtor instead of constant
partial_sort
prev_permutaion: recorder elements in the container
sort
sort_heap: converts a heap to ordered, unstable sort stable_sort
removing algorithm replace reverse rotate