Greedy is an algorithmic paradigm that builds up a solution piece by piece, always choosing the next piece that offers the most obvious and immediate benefit. Greedy algorithms are used for optimization problems.
- Connect n ropes with minimum cost
- Graph coloring
- Fractional Knapsack Problem
- Minimize Cash Flow among a given set of friends who have borrowed money from each other
- Find minimum time to finish all jobs with given constraints
- Find maximum sum possible equal to sum of three stacks
- Dail’s Algorithm
- Boruvka’s algorithm
This article is contributed by Ayushmaan Bansal. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- Greedy Algorithms | Set 1 (Activity Selection Problem)
- Greedy Algorithms | Set 3 (Huffman Coding)
- Greedy Algorithms | Set 2 (Kruskal’s Minimum Spanning Tree Algorithm)
- Greedy Algorithm to find Minimum number of Coins
- Minimum Number of Platforms Required for a Railway/Bus Station
- Minimum increment/decrement to make array non-Increasing
- Sum of Areas of Rectangles possible for an array
- Sorting array with reverse around middle
- Minimum rooms for m events of n batches with given schedule
- Minimum operations to make GCD of array a multiple of k