浙江大学DS05Ch10aA高级数据结构.pptVIP

CHAPTER 10 ALGORITHM DESIGN TECHNIQUES §1 Greedy Algorithms ? Optimization Problems: Given a set of constrains and an optimization function. Solutions that satisfy the constrains are called feasible solutions. A feasible solution for which the optimization function has the best possible value is called an optimal solution. ? The Greedy Method: Make the best decision at each stage, under some greedy criterion. A decision made in one stage is not changed in a later stage, so each decision should assure feasibility. 1/12 §1 Greedy Algorithms 2/12 Note: Greedy algorithm works only if the local optimum is equal to the global optimum. Greedy algorithm does not guarantee optimal solutions. However, it generally produces solutions that are very close in value (heuristics) to the optimal, and hence is intuitively appealing when finding the optimal solution takes too much time. §1 Greedy Algorithms 1. Huffman Codes – for file compression 〖Example〗 Suppose our text is a string of length 1000 that comprises the characters a, u, x, and z. Then it will take ? bits to store the string as 1000 one-byte characters. 8000 Notice that we have only 4 distinct characters in that string. Hence we need only 2 bits to identify them. We may encode the symbols as a = 00, u = 01, x = 10, z = 11. For example, aaaxuaxz is encoded as 0000001001001011. Then the space taken by the string with length 1000 will be 2000 bits + space for code table. /* ?log C? bits are needed in a standard encoding where C is the size of the character set */ ? frequency ::= number of occurrences of a symbol. In string aaaxuaxz , f(a) = 4, f(u) = 1, f(x) = 2, f(z) = 1. The size of the coded string can be reduced using variable-length codes, for example, a = 0, u = 110, x = 10, z = 111. 00010110010111 3/12 Discussion 9: In what case that there are not likely to be any savings even using Huffman codes? §1 Greedy Algorithms