Catalog · Introduction to Algorithms Lecture 19 of 47 Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths ← Previous Lecture 18: Speeding up Dijkstra Next → Lecture 20: Dynamic Programming II: Text Justification, Blackjack ✓ Mark complete Materials Transcript (PDF) ↗ transcript