Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths

Why it was recommended

Please watch this MIT intro

Recommendationdominotw · Original2021-04

What it covers

Erik Demaine's MIT 6.006 lecture introducing dynamic programming through Fibonacci numbers and shortest paths. It covers memoization, subproblems and optimal substructure. It is for someone meeting the subject for the first time.

Video details

Channel

MIT OpenCourseWare

Length

51 min 47 sec

Year

2013

More in this topic

• CppCon 2017: Matt Kulukundis “Designing a Fast, Efficient, Cache-friendly Hash Table, Step by Step”
• The Fast Fourier Transform (FFT): Most Ingenious Algorithm Ever?
• Modern Dictionaries by Raymond Hettinger
• CppCon 2014: Chandler Carruth "Efficiency with Algorithms, Performance with Data Structures"
• CppCon 2017: Juan Pedro Bolivar Puente “Postmodern immutable data structures”
• Sorting Algorithms: Speed Is Found In The Minds of People - Andrei Alexandrescu - CppCon 2019