讲解经典算法,并且有例题讲解。书中部分内容:2.2 动态规划 (Dynamic Programming)
2.2.1 背包问题(Knapsack problem)
2.2.2 最长递增子序列(Longest increasing subsequence)
2.2.3 Sequence alignment
2.2.4 最长相同子序列(Longest common subsequence)
2.3.5 Matrix-chain multiplication
2.3.6 树上的独立集 (Max Independent set in tree)
等,不一一列出