6.006 | Spring 2008 | Undergraduate

Introduction to Algorithms

Lecture Notes

Lecture 19: Dynamic Programming I: Memoization, Fibonacci, Crazy Eights, Guessing

Description:

Lecture notes on dynamic programming, memoization and subproblems, Fibonacci, shortest paths, crazy eights, and guessing viewpoint. Guessing Viewpoint

Resource Type:
Lecture Notes
pdf
496 kB
Lecture 19: Dynamic Programming I: Memoization, Fibonacci, Crazy Eights, Guessing
Learning Resource Types
Problem Sets
Exams with Solutions
Lecture Notes
Presentation Assignments with Examples