6.006 | Fall 2011 | Undergraduate

Introduction to Algorithms

Recitation Videos

Recitation 19: Dynamic Programming: Crazy Eights, Shortest Path

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

Course Info

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