[lorigami]

Hi I wanted to turn this program into an applet, but I've never made one before so I was wondering if anyone could help me. Thanks.

public final class MakeChange
{
	// Dynamic programming algorithm to solve change making problem.
	// As a result, the coinsUsed array is filled with the
	// minimum number of coins needed for change from 0 -> maxChange
	// and lastCoin contains one of the coins needed to make the change.
	public static void makeChange( int [ ] coins, int differentCoins,
				int maxChange, int [ ] coinsUsed, int [ ] lastCoin )
	{
		coinsUsed[ 0 ] = 0; lastCoin[ 0 ] = 1;

		for( int cents = 1; cents <= maxChange; cents++ )
		{
			int minCoins = cents;
			int newCoin  = 1;

			for( int j = 0; j < differentCoins; j++ )
			{
				if( coins[ j ] > cents )   // Cannot use coin j
					continue;
				if( coinsUsed[ cents - coins[ j ] ] + 1 < minCoins )
				{
					minCoins = coinsUsed[ cents - coins[ j ] ] + 1;
					newCoin  = coins[ j ];
				}
			}

			coinsUsed[ cents ] = minCoins;
			lastCoin[ cents ]  = newCoin;
		}
	}

	// Simple test program
	public static void main( String [ ] args )
	{
		// The coins and the total amount of change
		int numCoins = 5;
		int [ ] coins = { 1, 5, 10, 21, 25 };
		int change = 0;

		if( args.length == 0 )
		{
			System.out.println( "Supply a monetary amount on the command line" );
			System.exit( 0 );
		}

		try
		  { change = Integer.parseInt( args[ 0 ] ); }
		catch( NumberFormatException e )
		{
			System.out.println( e );
			System.exit( 0 ); 
		}

		int [ ] used = new int[ change + 1 ];
		int [ ] last = new int[ change + 1 ];

		makeChange( coins, numCoins, change, used, last );

		System.out.println( "Best is " + used[ change ] + " coins" );

		for( int i = change; i > 0; )
		{
			System.out.print( last[ i ] + " " );
			i -= last[ i ];
		}
		System.out.println( );
	}
}

[jimdandy75]

try these:
Tutorial 1
Tutorial 2