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
Recitation Videos
Recitation 19: Dynamic Programming: Crazy Eights, Shortest Path
| Instructors: | |
| Course Number: |
|
| Departments: | |
| As Taught In: | Fall 2011 |
| Level: |
Undergraduate
|
Learning Resource Types
theaters
Lecture Videos
theaters
Recitation Videos
assignment_turned_in
Problem Sets with Solutions
grading
Exams with Solutions
assignment_turned_in
Programming Assignments with Examples
notes
Lecture Notes