Lecture 8. 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
• Video on canvas

📦 Code

• 08-PerformanceBigO.pdf
• 08-PerformanceBigO.pptx