Lecture 7. Big O Notation and Algorithmic Analysis

Wednesday July 7


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

Readings

Links

📦 Code and Slides