- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- MS Excel
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP
- Physics
- Chemistry
- Biology
- Mathematics
- English
- Economics
- Psychology
- Social Studies
- Fashion Studies
- Legal Studies

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

# Introduction to Greedy Algorithms

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

- Related Articles
- Introduction to Backtracking Algorithms
- Introduction to Searching Algorithms
- Introduction to Graph Algorithms
- Introduction to Divide & Conquer Algorithms
- Introduction to Pattern Searching Algorithms
- Introduction to Analysis of Algorithms
- Introduction to Algorithms for Mathematical Problems
- C++ Program to Perform Greedy Coloring
- Introduction to Databases
- Introduction to Backtracking
- Introduction to Anime.js
- Introduction to Iptables
- Introduction to Miscellaneous Problems
- Introduction to Sorting Techniques
- Introduction to Dynamic Programming

Advertisements