Greedy Algorithms

A Greedy Algorithms is a type of  algorithmic that is used to solve optimization problems. While using greedy algorithms, optimal selections are made at each stage and these selections in common provides the way to solve the problem efficiently.

In simple word, greedy approach is used to find the best fit solution by choosing locally optimal solution that leads to globally optimized solutions. Greedy algorithm approach is used by many problems like Data Compression (Huffman encoding) and Shortest Path Selection (Dijkstra’s algorithm).