Greedy algorithm is designed to achieve optimum solution for a given problem. In greedy algorithm approach, decisions are made from the given solution domain. As being greedy, the closest solution that seems to provide an optimum solution is chosen.
Greedy algorithms try to find a localized optimum solution, which may eventually lead to globally optimized solutions. However, generally greedy algorithms do not provide globally optimized solutions.
In this Section We are going to cover −
- Activity Selection Problem
- Dijkstra’s Algorithm for Adjacency List Representation
- Dijkstra’s Shortest Path Algorithm
- Huffman Coding Algorithm
- Efficient Huffman Coding for Sorted Input
- Job Sequencing Problem with Deadlines
- Kruskal’s Minimum Spanning Tree Algorithm
- Minimum Coin Change Problem
- Minimum Number of Platforms Problem
- Prim’s Minimum Spanning Tree Algorithm
- Prim’s MST for Adjacency List Representation
- Fractional Knapsack Problem