Lecture 27. Dynamic Proigramming (2)

Today, we talked about the longest increasing subsequence. We gave two algorithms with running time O(n^2) and O(n log n).

Then we talked about 0-1 Knapsack problem and gave a dynamic programming algorithm for it.