Home » Courses » Electrical Engineering and Computer Science » Introduction to Algorithms » Lecture Videos » Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths

Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths

Flash and JavaScript are required for this feature.

Download the video from iTunes U or the Internet Archive.

About this Video
Playlist
Lecture Notes
Download this Video

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

MIT OpenCourseWare makes the materials used in the teaching of almost all of MIT's subjects available on the Web, free of charge. With more than 2,000 courses available, OCW is delivering on the promise of open sharing of knowledge.

© 2001–2012
Massachusetts Institute of Technology

Your use of the MIT OpenCourseWare site and materials is subject to our Creative Commons License and other terms of use.