HackerTube 中文?

Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths

MIT OpenCourseWareYouTube ↗

Further reading 1

What can a language express, and what can it guarantee? →Factorial can be written without naming the function. That trick raises a harder question: if every program must terminate, can unrestricted recursion be allowed? Take that distinction into slides, libraries and language extensions.This video helps answer · What does a recursive call leave behind?

Caption notes

Fibonacci exposes repeated calls to the same subproblem. After memoization, count distinct subproblems and the work performed within each call.

Video or transcript source ↗
Original passages · 2
split it into subproblems, solve those subproblems, and reuse the solutions to your subproblems.
Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths · ▶ 5:49–5:56
So I count how many different subproblems do I need to do?
Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths · ▶ 22:42–22:45

Hacker News comments

View original on HN ↗