https://github.com/harshit7962/standard_greedy_algorithms
https://github.com/harshit7962/standard_greedy_algorithms
Last synced: about 2 months ago
JSON representation
- Host: GitHub
- URL: https://github.com/harshit7962/standard_greedy_algorithms
- Owner: harshit7962
- Created: 2022-06-20T03:58:50.000Z (almost 3 years ago)
- Default Branch: main
- Last Pushed: 2022-06-20T06:35:03.000Z (almost 3 years ago)
- Last Synced: 2025-02-09T04:35:39.579Z (3 months ago)
- Language: C++
- Size: 3.91 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Greedy Algorithms
Greedy algorithm is an approach for solving a problem by selecting the best option available at the moment. It doesn't worry wheteher the current best result will bring overeall optimal result...
The core idea of greedy hence lies in finding local minimum/maximum in quest to find global minimum/maximum...
Few of very known greedy algorithms include:
- Prim's Algorithm
- Krushkal's Algorithm
- Dijkstra's Algorithm
- Kanpsack Problem
- Huffman Coding
- Ford-Fulkerson Algorithm
## Advantages of Greedy Approach:
- The algorithm is easier to describe
- The algorithm can perform better than other algorithms
## Drawback of Greedy Approach:
- Greedy algorithm doesn't always produce the optimal solution.