“105 STL Algorithms in Less Than an Hour”

on YouTube ↗58m

" summary

Covers all 105 algorithms in the STL as of C++17 and groups them into logical regions on a map; demonstrates concrete calls like std::make_heap / push_heap / pop_heap / sort_heap, std::sort / partial_sort / nth_element, and partition / stable_partition; explains set algorithms (set_difference, set_union) with linear complexity and why they beat naive quadratic code; shows practical pitfalls and fixes: copy vs copy_backward, the remove–erase idiom, uninitialized_fill/uninitialized_copy and std::destroy, and when transform or for_each (for side effects) are the right tool.

AI-written summary · about

" chapters (16)

1. 0:00Introduction and motivation
2. 6:50Why learn STL algorithms
3. 9:05Overview of STL algorithms map
4. 10:52Algorithms on heaps
5. 16:00Sorting algorithms
6. 18:06Partitioning algorithms
7. 19:17Permutation algorithms
8. 21:25Stable and predicate runes
9. 23:14Query algorithms
10. 33:42Algorithms on sets
11. 36:15Mover and value modifier algorithms
12. 39:29Structure changer algorithms
13. 41:17Copy and if runes
14. 45:43Transform and for_each
15. 49:18Raw memory algorithms
16. 54:07Using and learning STL algorithms