Huffman Code – An example of Greedy Algorithm

Introduction A greedy algorithm always makes the choice that looks best at the moment. It makes a locally optimal choice in the hope that this choice will lead to a globally optimal solution. Greedy algorithms do not result in optimal solutions always but for many problems they do. A problem can be solved by Greedy... Continue Reading →

Create a free website or blog at

Up ↑