Home » Courses » Electrical Engineering and Computer Science » Introduction to Algorithms » Recitation Videos » Recitation 19: Dynamic Programming: Crazy Eights, Shortest Path

Recitation 19: Dynamic Programming: Crazy Eights, Shortest Path

Flash and JavaScript are required for this feature.

Download the video from iTunes U or the Internet Archive.

About this Video
Playlist
Recitation Notes
Download this Video

Description: This recitation uses dynamic programming to find subsequences in the card game Crazy Eights, and to find the shortest path in a graph.

Instructor: Victor Costan

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.