Lecture about dynamic programming
April 3, 2025
I gave this lecture to finalists of the Luxembourgish olympiad in informatics.
We discuss dynamic programming as a way to speed up recursive computations by remembering intermediate results to prevent computing the same thing twice.
As examples we go over the Fibonacci numbers, the Knapsack problem and the longest decreasing subsequence problem.
You can find the slides here: Dynamic programming