Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths

Name: Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths
Uploaded: 2013-01-14T00:00:00.000Z
Duration: 51 min 47 s
Description: This MIT lecture introduces dynamic programming as careful brute force — recursion + memoization + trying all guesses — using Fibonacci and shortest paths to derive memoized, bottom-up, and Bellman-Ford algorithms.

MIT OpenCourseWare · 51:47 · Watch on YouTube

This MIT lecture introduces dynamic programming as careful brute force — recursion + memoization + trying all guesses — using Fibonacci and shortest paths to derive memoized, bottom-up, and Bellman-Ford algorithms.

Read the full summary on retube

한국어