This PPT has Greedy Algorithms, Characteristics, Application of Greedy Algorithm

2. Introduction
Characteristics and Features
Application of Greedy method
Greedy property
Greedy Approach
The coin changing Problem
Problem solved by greedy method
Advantage and disadvantages of
greedy method
Kruskal’s algorithm
Prime’s algorithm

9. Used to Solve Optimization
Problems: Graph - Map Coloring, Graph -
Vertex Cover, Knapsack Problem, Job
Scheduling Problem, and activity selection
problem are classic optimization problems
solved using a greedy algorithmic
paradigm.

11. The main advantage of the greedy
method is that it is easy to implement
and understand. However, it is not
always guaranteed to find the best
solution and can be quite slow. The
greedy method works by making the
locally optimal choice at each stage in
the hope of finding the global optimum.

13. Kruskal's algorithm is a well-known algorithm
for finding the minimum spanning tree of a
graph. It is a greedy algorithm that makes use
of the fact that the edges of a minimum
spanning tree must form a subset of the
edges of any other spanning tree

14. Prim's algorithm helps you find the
minimum spanning tree of a graph. It is
a greedy algorithm – meaning it selects
the option available at the moment.