greedy algorithm always makes the choice that seems to be the best at that moment.

1. Greedy
technique
Bharati C

2. Greedy technique
The greedy approach suggest
constructing a solution
Through a sequency of steps, each
expanding a partially constructed
solution obtained so for until a
complete solution to the problem is
reached.

3. Feasible solution
Satisfying condition from
the problem

4. Optimal solution
A solution which already
feasible & also give
minimum cost.

5. Optimization problem
Problem
either
minimum or
maximum
results .

6. Example
A--------------B
A person travelled A city to B

7. P
S1--- walk
S2 bicycle
S3 bus
S4 train
S5 plane

8. P
S1--- walk
S2 bicycle
S3 bus
S4 train
S5 plane
10 hours contrains

9. P
S4 train
S5 plane
10 hours contrains
Feasible solution is s4,s5

10. P
S4 train
S5 plane
10 hours contrains
Feasible solution is s4,s5
Optimal solution is s4
Minimum cost

11. Algorithm: greedy(D, n)
Solution=0
for i=1 to n do
{
s=select(D)
If (feasible(solution, s) then
Solution=union(solution, s)
}
return solution

12. Greedy method following activies
performed
1. Select some solution from input.
2. We check whether solution is feasible or
not.
3. From set of feasible solution .perticular
solution satisfies i.e optimal solution.

13. THANK YOU