Algorithm question: Greedy algorithm to find minimum of coins ?

For US coins a greedy algorithm can be created to find the minimum amount of coins needed to make change for a monetary amount. Create a greedy algorithm that will work with US coins, to find the minimum amount of coins needed to make change for a monetary amount. Then, make a set of integer valued coins and give a monetary amount for which your algorithm will fail