This lecture covers asymptotic analysis and "Big O" notation, which enables us to quantitatively and qualitatively analyze algorithms for their speed.
Readings
- Text 10.2
Links
📦 Code and Slides
Lecture 8. Big-O and Algorithmic Analysis
Wednesday October 6