Main Article Content

Abstract

Greedy algorithm is an intuitive and simple algorithm used for solving optimization problems. Algorithm works on sub-solutions with the intention to solve entire problem. At every step, it finds a local optimal solution with reference to current problem state and proceeds towards reaching the global optimal solution. The algorithm is not efficient to solve all optimization problems.  Those problems that exhibit greedy choice property and optimal substructure can only be solved by greedy algorithm. This paper discusses few optimization problems that can be solved using greedy approach, along with the proof that how they qualify to be solved by the algorithm. 

Article Details