This lecture covers asymptotic analysis and "Big O" notation, which enables us to quantatively and qualitatively analyze algorithms for their speed. We'll also see that efficiency isn't everything when it comes to evaluating programs.
Readings
- Text 10.1, 10.2
Links
📦 Code and Slides