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

Подробнее о видео

MIT 6.006 Introduction to Algorithms, Spring 2020
Instructor: Erik Demaine
View the complete course:
YouTube Playlist:

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.

License: Creative Commons BY-NC-SA
More information at
More courses at
Support OCW at

We encourage constructive comments and discussion on OCW’s YouTube and other social media channels. Personal attacks, hate speech, trolling, and inappropriate comments are not allowed and may be removed. More details at .