Find_Minimum_Coins.java

// Java program to find minimum
// number of coins 
import java.util.Vector;

class Code
{
    // Greedy Algorithm to find minimum no of coins
	
	static int deno[] = {1, 2, 5, 10, 20,50, 100, 500, 1000};
	static int n = deno.length;

	static void findMin(int V)
	{
	
		Vector<Integer> ans = new Vector<>();

       // Traversal
		for (int i = n - 1; i >= 0; i--)
		{
			// Find denominations
			while (V >= deno[i])
			{
				V -= deno[i];
				ans.add(deno[i]);
			}
		}

		// Printing result
		for (int i = 0; i < ans.size(); i++)
		{
			System.out.print(
				" " + ans.elementAt(i));
		}
	}

	public static void main(String[] args)
	{
		int n = 93;
		System.out.print(
			"Following is minimum number "
			+"of change for " + n + ": ");
		findMin(n);
	}
}