The Standard Template Library (STL) of C++ provides a collection of containers and algorithms
for programmers to use. Here is a list of containers and algorithms in STL of C++:
Containers:
1. vector
2. deque
3. list
4. forward_list
5. set
6. multiset
7. map
8. multimap
9. unordered_set
10. unordered_multiset
11. unordered_map
12. unordered_multimap
13. stack
14. queue
15. priority_queue
16. bitset
17. Array
Algorithms:
1. sort
2. stable_sort
3. partial_sort
4. nth_element
5. make_heap
6. push_heap
7. pop_heap
8. sort_heap
9. binary_search
10. lower_bound
11. upper_bound
12. equal_range
13. merge
14. inplace_merge
15. set_union
16. set_intersection
17. set_difference
18. set_symmetric_difference
19. reverse
20. rotate
21. random_shuffle
22. unique
23. adjacent_find
24. count
25. count_if
26. find
27. find_if
28. find_end
29. find_first_of
30. for_each
31. transform
32. remove
33. remove_if
34. replace
35. replace_if
36. copy
37. copy_if
38. copy_backward
39. fill
40. fill_n
41. generate
42. generate_n
43. iota
44. swap
45. iter_swap
46. min
47. max
48. min_element
49. max_element
50. accumulate
51. inner_product
52. adjacent_difference
53. Partial_sum
Note that this list is not exhaustive, as there are other containers and algorithms in the STL of
C++ that are not included in this list.