1. Search Algorithm (13) to determine whether a container contains a certain value
Adjacent_find ()
Binary_search ()
Count ()
Count_if ()
Performance_range ()
Find ()
Find_end ()
Find_first_of ()
Find_if ()
Lower_bound ()
Upper_bound ()
Search ()
Search_n () 2. Sorting and general (ordering) algorithms (14)
Provides an element sorting policy.
The stable algorithm ensures that the original sequence of equal elements remains unchanged.
Inplace_merge ()
Merge ()
Nth_element ()
Partial_sort ()
Partial_sort_copy ()
Partition ()
Random_shuffle ()
Reverse ()
Reverse_copy ()
Rotate ()
Rotate_copy ()
Sort ()
Stable_sort ()
Stable_partition () 3. Delete and replace algorithms (15)
Copy ()
Copy_backwards ()
Iter_swap ()
Remove ()
Remove_copy ()
Remove_if ()
Remove_copy_if ()
Replace ()
Replace_copy ()
Replace_if ()
Replace_copy_if ()
Swap ()
Swap_range ()
Unique ()
Unique_copy () 4. permutation and combination algorithms (2)
Calculates all possible permutation and combinations of a given set in a certain order.
Next_permutation ()
Prev_permutation () 5. Arithmetic algorithms (4)
Accumulate ()
Partial_sum ()
Inner_product ()
Adjacent_difference () 6. Generate and variant algorithms (6)
Fill ()
Fill_n ()
For_each ()
Generate ()
Generate_n ()
Transform () 7. Relational algorithms (7)
Equal ()
Includes ()
Lexicographical_compare ()
Max ()
Max_element ()
Min ()
Min_element ()
Mismatch () 8. Set Algorithms (4)
Set_union () combines two sets
Set_intersection () returns the intersection
Set_difference (): First set minus second set
Set_effecric_difference () is a set of elements that exist only in one set. 9. Heap algorithm (4)
Make_heap ()
Pop_heap ()
Push_heap ()
Sort_heap () |
