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.
Watch video 15. Dynamic Programming, Part 1: SRTBOT, Fib, DAGs, Bowling online without registration, duration hours minute second in high quality. This video was added by user MIT OpenCourseWare 13 September 2021, don't forget to share it with your friends and acquaintances, it has been viewed on our site 91,715 once and liked it 1.4 thousand people.