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

Name: Lecture 15: Dynamic Programming, Part 1: SRTBOT, Fib, DAGs, Bowling
Uploaded: 2021-09-13T16:19:44Z
Duration: 57 min 18 s
Description: 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

57:18

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