15. Dynamic Programming, Part 1: SRTBOT, Fib, DAGs, Bowling
MIT 6.006 Introduction to Algorithms, Spring 2020
Instructor: Erik Demaine
View the complete course: https://ocw.mit.edu/6-006S20
YouTube Playlist: • MIT 6.006 Introduction to Algorithms,...
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 https://ocw.mit.edu/terms
More courses at https://ocw.mit.edu
Support OCW at http://ow.ly/a1If50zVRlQ
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 https://ocw.mit.edu/comments.
On this page of the site you can watch the video online 15. Dynamic Programming, Part 1: SRTBOT, Fib, DAGs, Bowling with a duration of hours minute second in good quality, which was uploaded by the user MIT OpenCourseWare 13 September 2021, share the link with friends and acquaintances, this video has already been watched 91,715 times on youtube and it was liked by 1.4 thousand viewers. Enjoy your viewing!
