Arrays and Dynamic Arrays
Contiguous indexed storage, resizing, amortized append, and shifting costs.
Contiguous indexed storage, resizing, amortized append, and shifting costs.
A representation-first map for choosing containers by operations, invariants, and memory behavior.
A comparison of contiguous sequences, linked nodes, stacks, and queues.
Node-linked sequences, local splicing, traversal costs, and ownership invariants.
FIFO processing through deques, linked endpoints, and circular buffers.
The LIFO interface, implementation choices, and algorithmic invariants it expresses.