Greedy Algorithms
- Greedy Algorithm works by making the decision that seems most promising at any moment; it never reconsiders this decision, whatever situation may arise later.
- Advantages:
- Straigth forward
- easy to understand and code
- No re-examining
- Disadvantages:
- Applications:
- Sorting:Selection Sort,Topological Sort
- Priority Queue: Heap Sort
- huffman coding compression algorithm
- Prims ans Kruskals Algorithm
- Dijkstra's
- Coin Change Problem
- Fractional Knapack problem
- Disjoint sets
- Job scheduling
Useful Resources:
Related Posts
Subscribe to:
Post Comments
(
Atom
)
No comments :
Post a Comment