Catalog · Introduction to Algorithms (SMA 5503) Lecture 2 of 23 Lecture 2: Asymptotic Notation; Recurrences; Substitution, Master Method ← Previous Lecture 1: Administrivia; Introduction; Analysis of Algorithms, Insertion Sort, Mergesort Next → Lecture 3: Divide-and-Conquer: Strassen, Fibonacci, Polynomial Multiplication ✓ Mark complete Materials Transcript (PDF) ↗ transcript