MIT

Lecture 15: Dynamic Programming, Part 1: SRTBOT, Fib, DAGs, Bowling

Data Science, Analytics & Computer TechnologyAlgorithms and Data StructuresComputer ScienceScience & MathMathematicsEngineering

Om kurset

This is the first of four lectures on dynamic programing. This begins with how to solve a problem recursively and continues with three examples: Fibonacci, DAG shortest paths, and bowling. Instructor: Erik Demaine