Module 17 · Under the Hood: Memory, Cache, Allocators and the Guarantees
Every Operation, With Its Qualifier
ProReading
Bob sees O(1) beside insertion and stops reading. His program then searches a linked row before every insert. The row grows, and the deadline passes. Amara asks him to price the complete operation, including finding its place.
Checking what this lesson needs for you…
What is inside Every Operation, With Its Qualifier
- What a complexity bound counts
- Every container in one cost table
- Read size and positions
- Append and emplace
- Insert at a known place
- Erase one or several
- Find by key
- Reserve and clear
- Transfer and sort