Lecture 7. Big O and Asymptotic Analysis

This lecture covers asymptotic analysis and "Big O" notation, which enables us to quantatively and qualitatively analyze algorithms for their speed.

Readings

• Text 10.1, 10.2

Links

• Slides
• [Lecture Q&A]
• [Video on canvas]

📦 Code

• BigO.zip