Lecture 9: Dynamic Programming: Logcutter, MatrixChain
We introduced the technique known as dynamic progmaming. We studied a stair climbing problem, the logcutter dilemna, and the matrix chain multiplication problem.
- Stairs
- Stairs (Recursively)
- Stairs (Memoized)
- Stairs (DP)
- LogCutter
- LogCutter: Greedy Fails
- LogCutter: DP
- Matrix Chain Mult
To view this video please enable JavaScript.