Coin Changing Problem
Coin Changing Problem
Greedy approach:
N=20
Coin ={1,5,10}
20-10=10 1
10-10=0 2
Or
20-10=10
5___> 10-5=5
5---- 5-5=0
Problem 2:
N=41
25--- 41-25= 16
10-> 16-10= 6
N=4
i/j 0 1 2 3 4
1 1 1 1 1 1
2 1 1 2 2 3
3 1 1 2 3 4
0 having no chance : 1
22
2 11
31