LECTURE 2 OF 25
Arrays
Learn how indexed storage works, what each array operation costs, and how one safe pass grows into in-place and matrix algorithms.
Builds on
Best read after 1. Big-O Notation — you can still read ahead, but some of this may lean on ideas covered there.