华南理工大学数据结构与算法课件Chapter11 Greedy Algorithm.pptVIP

* * Chapter 11 Greedy Algorithm 11.1 Optimization 11.2 Algorithm Idea 11.3 Applications 11.3.1 Container Ship 11.3.2 0-1 Knapsack Problem 11.3.3 Topological Sorting 11.3.4 Binary Overlay 11.3.5 Single-Source Shortest Path 11.3.6 Minimum Cost Spanning Tree The previous chapters describe the data structure and storage methods and related operations to achieve algorithms. From this chapter, we will discuss the algorithm design problem. Not exist a technology that can be used to design all the algorithms, therefore, a good algorithm design is more like an art. Nevertheless, there are s