human
Greedy Algorithm to find Minimum number of Coins | Python3 program to find minimum number of denominations.
All denominations of Indian Currency.
Initialize Result.
Traverse through all denomination.
Find denominations.
Print result.
Driver Code"
How can the above be solved in Python?

=====
Write me a code to greedy Algorithm to find Minimum number of Coins and the other steps required?
assistant
#Here is code to greedy Algorithm to find Minimum number of Coins and the other steps required.
 def findMin ( V ) :
	deno = [ 1 , 2 , 5 , 10 , 20 , 50 , 100 , 500 , 1000 ]
	n = len ( deno )
	ans = [ ]
	i = n - 1
	while ( i >= 0 ) :
		while ( V >= deno [ i ] ) :
			V -= deno [ i ]
			ans . append ( deno [ i ] )
		i -= 1
	for i in range ( len ( ans ) ) :
		print ( ans [ i ] , end = " ▁ " )
if __name__ == ' _ _ main _ _ ' :
	n = 93
	print ( " Following ▁ is ▁ minimal ▁ number " , " of ▁ change ▁ for " , n , " : ▁ " , end = " " )
	findMin ( n )