title: What is the bad case in greedy algorithm for coin changing algorithm?
body: <p>The Coin changing problem is making change for n cents using the fewest number of coins.</p>
  
  <p>Can you give a set of coin denominations for which the greedy algorithm does not yield an optimal solution. The set should include a penny so that there is a solution for every n.</p>