105 STL Algorithms in Less Than an Hour
summary
Claims a full tour of 105 algorithms in the STL (including C++11 and C++17 additions) and shows concrete replacements for loops: make_heap / push_heap / pop_heap to build and extract heaps, sort/partial_sort/nth_element for ordering, transform_reduce and inclusive/exclusive scan for reductions, and the practical remove-erase idiom for deletes. Demonstrations include set operations (set_difference, merge), uninitialized algorithms for raw memory, and examples of when algorithms give better complexity or safer code than hand-written loops.
AI-written summary · about
chapters (19)
- 0:00Introduction to STL algorithms
- 1:12Why learn STL algorithms
- 8:57Beyond for_each
- 10:39Exploring STL algorithm world
- 12:29Heaps and sorting algorithms
- 19:23Partitioning collections
- 20:29Permutations and shuffling
- 22:59Modifiers and runes
- 25:12Querying values in collections
- 28:50Querying properties
- 32:09Searching in collections
- 35:47Algorithms on sets
- 37:34Moving and copying elements
- 40:10Value modifiers
- 41:37Removing elements
- 44:30Transform and for_each
- 46:47Uninitialized memory
- 50:06Using algorithms effectively
- 51:52Beyond standard library
related talks
01h 02m“STL Algorithms in Action "
01h 00mSTL Algorithms - why you should use them, and how to write your own
51mAlgorithms Demystified
57mFun with Algorithms
07mAlgorithm Mnemonics: Increase your Productivity with STL Algorithms
37mEnhancing STL containers
32mC++ Standard Library "Little Things”
51mKnow your algorithms; sorting and searching