MIT
Recitation 19: Dynamic Programming: Crazy Eights, Shortest Path
Data Science, Analytics & Computer TechnologyAlgorithms and Data StructuresComputer ScienceEngineering
Om kurset
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