华南理工大学数据结构与算法课件Chapter13 Dynamic Programming.pptVIP

* * Chapter 13 Dynamic Programming 13.1 Idea of the Algorithm 13.2 Application 13.2.1 0-1 Knapsack Problem 13.2.2 Image Compression 13.2.3 Matrix Multiplication Dynamic programming is the most difficult method of the 5 algorithms in this book presents, it is on the base of the principle of creating the optimal. Dynamic programming method can efficiently solve many problems that can’t be solved by the greedy algorithm or the Divide-and-Conquer algorithm. In introducing the basic idea of dynamic planning, the chapter will discuss the dynamic programming approach in solving the knapsack prob