Dynamic programming
This video introduces the concept of Dynamic Programming and illustrates this on the computation of binomial coefficients, the subset sum problem, and the knapsack problem. In particular it is illustrated how decorators in Python makes it easy so apply dynamic programming to recursive functions.
Lecture in Danish.
00:00 Binomial coefficients, recursive definition
03:12 Dynamic programming memoization: Binomial coefficients
10:01 Dynamic programming with decorator @memoize: Binomial coefficients
14:10 Decorator @trace
20:07 @lru_cache
21:15 Subset sum, recursive definition
24:59 Subset sum, @memoize solution
32:37 Subset sum, identifying solution
35:09 Knapsack problem, recursive definition
40:23 Knapsack, @memoize solution
43:10 Knapsack, identifying solution
46:20 Knapsack, systematic table filling
55:05 Recap
On this page of the site you can watch the video online Dynamic programming with a duration of hours minute second in good quality, which was uploaded by the user IPSA - Introduction to Programming 19 March 2021, share the link with friends and acquaintances, this video has already been watched 674 times on youtube and it was liked by like viewers. Enjoy your viewing!
