Topic 14. Iterators, algorithms, ranges, and lambda expressions

Goal: learn to build algorithms with explicit preconditions, safe captures, and a controlled lifetime of ranges.

Lecture contents

1. Iterators and invalidation — A position instead of a tie to the container · Categories and algorithm requirements · Invalidation: A structural change changes positions · remove, erase, and output iterators
2. Lambda expressions and functors — A lambda as an object with state · Functors, invoke, and algorithm predicates
3. Standard library algorithms — Searching, filtering, sorting, and permuting · Numeric algorithms and associativity
4. Ranges and views — Ranges algorithms and projections · Views, laziness, and materialization · Lifetime and a custom range
5. Case studies and common mistakes — A step-by-step pipeline walkthrough · Contracts of numeric algorithms on concrete values · Checking lifetime before returning a result · A test matrix for an algorithmic solution · Choosing an algorithm by the required result

Practice and review

• Practice — 3 worked examples with full code and output
• Tasks — 30 variants, each with tasks at three difficulty levels
• Summary — conclusions and self-check questions