-
Notifications
You must be signed in to change notification settings - Fork 3.2k
algorithm
Junyan Liu edited this page Aug 16, 2017
·
3 revisions
-
基本算法（14个） 定义在 algobase.h
- min
- max
- iter_swap
- copy
- copy_backward
- copy_if
- copy_n
- move
- move_backward
- equal
- fill
- fill_n
- lexicographical_compare
- mismatch
-
数值算法（5个） 定义在 numeric.h
- accumulate
- adjacent_difference
- inner_product
- iota
- partial_sum
-
set 算法（4个） 定义在 set_algo.h
- set_difference
- set_intersection
- set_symmetric_difference
- set_union
-
heap 算法（4个） 定义在 heap_algo.h
- make_heap
- pop_heap
- push_heap
- sort_heap
-
其它算法（54个） 定义在 algo.h
- adjacent_find
- all_of
- any_of
- binary_search
- count
- count_if
- equal_range
- find
- find_end
- find_first_of
- find_if
- find_if_not
- for_each
- generate
- generate_n
- includes
- inplace_merge
- is_heap
- is_sorted
- is_permutation
- lower_bound
- max_element
- median
- merge
- min_elememt
- next_permutation
- none_of
- nth_element
- partial_sort
- partial_sort_copy
- partition
- partition_copy
- prev_permutation
- 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
- sort
- swap_ranges
- transform
- unique
- unique_copy
- upper_bound