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
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
Instructors: | |
Course Number: |
|
Departments: | |
As Taught In: | Fall 2011 |
Level: |
Undergraduate
|