MINIMUM NUMBER OF COIN

Prepared by: Baldev Jivani

Enrollment No: 21002170510012
Guided By : Stephy Patel B.E. [Branch] (5th Sem)
Assistant Professor (LJU)
Content
ABSTRACT
INTRODUCTION
OBJECTIVE
METHODOLOGY
FUTURE WORK SCOPE
APPLICATION
ADVANTAGES/DISADVANTAGES
 ABSTRACT
• Given an array coins[] of size N and a target V , where coins[i]
represents the coins of different denominations . You have an infinite
supply of each of coins . The task is to find minimum number of coins
required to make the given value V .

• Examples :-

• Input : coins[]={25,10,5} , V=30

• Output : Minimum 2 coins required We can use one coin of 25 cents
and one of 5 cents
INTRODUCTION
• At first , we’ll know the change making problem with a real life
example
• Given a value of V Rs and an infinite supply of each of the
denominations {1,2,5,10,20,50,100,500,1000} valued coins/notes , The
task is to find the minimum number of coins and notes needed to
make the change.
• The intuition would be to take coins with greater value first . This can
reduce the total number of coins needed . Start from the largest
possible denomination and keep adding denominations while the
remaining value is greater than 0.
OBJECTIVE
• This project aims to effectively manage change money , ensuring the
seamless handling and tracking of small denominations and coins .
• Through innovative solutions , we seek to optimize the process ,
enhance accuracy , and provide a streamlined system for efficient
change management.
• This presentation will outline the key objectives , features and the
positive impact our project brings to stakeholders and users.
METHODOLOGY
STEP-1 : Sort the array of coins in decreasing order.
STEP-2 : Initialize result as empty.
STEP-3 : find the largest denomination that is smaller than current
amount.
STEP-4 : Add found denomination to result . Subtract value of
found denomination from amount.
STEP-5 : If amount becomes 0 , then print result.
STEP-6 : Else repeat steps 3 and 4 for new value of V.
FUTURE WORK SCOPE
APPLICATION
ADVANTAGES/DISADVANTAGES
• The greedy algorithm doesn’t always guarantee the optimal
solution however it generally produce a solution that is very close
in value to the optimal.
• The algorithm never reverses the earlier decision even if the
choice is wrong.
THANK YOU