Programming question (algorithm)

int coins = { 50,25,10,1 };
int nCoins = 4;

// returns biggest coin that can be used as money, and returns it
// or a 0 if we can't make change
int getBiggestCoin(int money)
{
	int i = 0;
	int coin = 0;
	// if smallest coin is too big, give up
	if(coins[nCoins-1] > money)
		return 0;
	// look through until we find the right coin
	while(coins[i] > money && i < nCoins)
		i++;
	return coins[i];
}

int makeChange(int amount)
{
	int change;
	while(change = getBiggestCoin(amount)) // when change returns 0, while loop terminates
	{
		print("%d ", change); // print out coin value
		amount -= change; // deduct from total
	}
	if(amount > 0)
		print("\nCouldn't make change for last %d cents.", amount);
}

Option Explicit
'VB6 Code by HiddenX 2011

Const maxindex As Long = 5
Dim coin(1 To maxindex) As Long
Dim change As Long

Sub Init()
    coin(5) = 25
    coin(4) = 20
    coin(3) = 10
    coin(2) = 5
    coin(1) = 1
    
    change = 99
End Sub

'Greedy Algorithm - recursive
Sub coincheck(value As Long, index As Long)
    If value >= coin(index) Then
        Debug.Print coin(index) & ","
        value = value - coin(index)
        If value = 0 Then
            Debug.Print "<Ready>"
        Else
            coincheck value, index
        End If
    Else
        index = index - 1
        If index >= 1 Then
            coincheck value, index
        Else
            Debug.Print "<Cancel>"
        End If
    End If
End Sub

'Main
Private Sub Form_Load()
    Init
    coincheck change, maxindex
End Sub

static int[] getComb(int amount, int[] coins, int[] sol){
		if( amount == 0)
			return sol;
		else if( amount < 0 || coins.length <= 0)
			return null;		
		if( coins[0] > amount )
			coins = remove(coins,0);
		else{
			amount -= coins[0]; 
			sol = add(sol, coins[0]);
			coins = remove(coins,0);
		}
		return getComb(amount, coins, sol);
}

static int[] getComb(int amount, int[] coins, int[] sol){
		if( amount == 0)
			return sol;
		else if( amount < 0 || coins.length <= 0)
			return null;		
		if( coins[0] > amount )
			coins = remove(coins,0);
		else{
			amount -= coins[0]; 
			sol = add(sol, coins[0]);
			coins = remove(coins,0);
		}
		return getComb(amount, coins, sol);
}