国外算法设计与分析课件14.pptVIP

Design and Analysis of Algorithms - Chapter 9 Greedy Algorithms (I) Greed, for lack of a better word, is good! Greed is right! Greed works! - Michael Douglas, U.S. actor in the role of Gordon Gecko, in the film Wall Street, 1987 Main topics Idea of the greedy approach Change-making problem Minimum spanning tree problem Prim’s algorithm Kruskal’s algorithm Properties of minimum spanning tree (additive part) Bottleneck spanning tree (additive part) Expected Outcomes Student should be able to summarize the idea of the greedy technique list several applications of the greedy technique apply the greedy technique to change-making problem define the minimum spanning tree problem describe ideas of Prim and Kruskal’s algorithms for computing minimum spanning tree prove the correctness of the two algorithms analyze the time complexities of the two algorithms under different data structures prove the various properties of minimum spanning tree Glossary Greedy: 贪婪的 Change-making problem: 找零钱问题 Cashier: 收银员 Denomination:货币单位，面额 Quarter, dime, nickel, penny: 2角5分，1角， 5分，1分（美国硬币单位） Irrevocable：不可取消的，不可逆的 Spanning tree: 生成树，支撑树 Anticipatory Set: Change Making Problem How to make 48 cents of change using coins of denominations of 25 (1 quarter coin), 10 (1 dime coin), 5 (1 nickel coin), and 1 (1 penny coin) so that the total number of coins is the smallest? The idea: Take the coin with largest denomination without exceeding the remaining amount of cents, make the locally best choice at each step. Is the solution optimal? Yes, the proof is left as exercise. General Change-Making Problem Given unlimited amounts of coins of denominations d1 … dm , give change for amount n with the least number of coins. Does the greedy algorithm always give an optimal solution for the general change-making problem? We give the following example, Example: d1 = 7c, d2 =5c, d3 = 1c, and n = 10c, not always produces an optimal solution. in fact, for some instances, the problem may not have a s