In greedy algorithms, we find the optimum solution. The closest solution which may be optimum is chosen. It may lead to optimized solutions but mostly greedy algorithms do not provide globally optimized solutions.
Travelling salesman problem
Prim's Minimal Spanning Tree Algorithm
Kruskal's Minimal Spanning Tree Algorithm
Dijkstra's Minimal Spanning Tree Algorithm
Graph - Map Coloring
Graph - Vertex Cover
Knapsack Problem
Job Scheduling Problem
Created 2019-01-23T11:45:03+05:18 · Edit