# Greedy Algorithm
Greedy algorithms are a simple, intuitive class of algorithms that can be used to find the optimal solution to some optimization problems. They are called greedy because at each step they make the choice that seems best at that moment. This means that greedy algorithms do not guarantee to return the globally optimal solution, but instead make locally optimal choices in the hope of finding a global optimum. Greedy algorithms are used for optimization problems. An optimization problem can be solved using Greedy if the problem has the following property: at every step, we can make a choice that looks best at the moment, and we get the optimal solution to the complete problem.

## Popular Greedy Algorithms
* Activity Selection
* [Huffman Coding](Huffman%20Coding%20Algorithm/readme.md)
* [Prim's Algorithm](Prim%27s%20Algorithm/readme.md)
* [Kruskal's Algorithm](Krushkal%27s%20Algorithm/readme.md)
* [Dijkstra's Algorithm](Dijkstra%27s%20Algorithm/readme.md)
* Job Sequencing
* Fractional Knapsack
* [Ford-Fulkerson Algorithm](Ford-Fulkerson/readme.md)
