6.006 | Fall 2011 | Undergraduate

Introduction to Algorithms

Lecture Videos

Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths

Description: This lecture introduces dynamic programming, in which careful exhaustive search can be used to design polynomial-time algorithms. The Fibonacci and shortest paths problems are used to introduce guessing, memoization, and reusing solutions to subproblems.

Instructor: Erik Demaine

Course Info

Learning Resource Types
Lecture Videos
Recitation Videos
Problem Sets with Solutions
Exams with Solutions
Programming Assignments with Examples
Lecture Notes