Description: Greedy algorithm is also known as mountain climbing method, the basic idea is to gradually obtain the optimal solution, using the greedy algorithm select those most likely to consider solutions to achieve results, that is the best step by step to reach the final of the global optimum. Huffman algorithm is to construct a prefix code of the greedy algorithm is optimal, bottom-up approach to construct the optimal prefix code, said binary tree T, the algorithm coded character set for each character c, frequency f (c) to f as a key priority queue Q with the greedy choice, effectively determine the current algorithm to merge the two trees with a minimum frequency, minimum frequency of once the two have merged tree to produce a new tree, The frequency of the frequency of the combined sum of the two trees, and the new tree into the priority queue Q.
To Search:
File list (Check if you may need any files):
tanxinsuanfa.txt
Download