STL Algorithms in Less Than an Hour

Explore the comprehensive world of STL algorithms in this 54-minute conference talk from ACCU 2018. Dive into a detailed overview of all 105 STL algorithms, including those introduced in C++11 and C++17. Gain insights into how these algorithms are grouped, the patterns they form within the STL, and their interrelationships. Learn to leverage this knowledge to create more expressive and robust code. Cover topics such as ranges, sorting, partitioning, permutations, random shuffling, querying, sets, value modification, and memory manipulation. Discover how understanding the big picture of STL algorithms can enhance your C++ programming toolkit and improve your code design.

Introduction
Whats an algorithm
Ranges
Why STL
For Each
The World
Sorting
Partitioning
Permutations
Random Shuffle
Runes
Queries
Query Properties
Research
Sets
Moving
Value Modifier
Abstract Changes
Transform
Memory