Greedy algorithm to find minimum number of coins

Given a value and given a collection that contains all positive coins. Our goal is to find minimum coins that sum is equal to given value.

Collection [] = {6, 3, 1, 4}
Value  : 23
Output : 6  6  6  4  1

Value  : 13
Output :  6  6  1
[Note 6 6 1 is minimum coin which sum is to 13]

Here given code implementation process.

1) Coin change using greedy algorithm in java 2) Coin change using greedy algorithm in c++ 3) Coin change using greedy algorithm in c# 4) Coin change using greedy algorithm in php 5) Coin change using greedy algorithm in python 6) Coin change using greedy algorithm in ruby 7) Coin change using greedy algorithm in scala 8) Coin change using greedy algorithm in swift 9) Coin change using greedy algorithm in golang 10) Coin change using greedy algorithm in kotlin 11) Coin change using greedy algorithm in vb.net 12) Coin change using greedy algorithm in node js