title: How to count possible combination for coin problem
body: <p>I am trying to implement a coin problem, Problem specification is like this</p>
  
  <p>Create a function to count all possible combination of coins which can be used for given amount.</p>
  
  <pre><code>All possible combinations for given amount=15, coin types=1 6 7 
  1) 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
  2) 1,1,1,1,1,1,1,1,1,6,
  3) 1,1,1,1,1,1,1,1,7,
  4) 1,1,1,6,6,
  5) 1,1,6,7,
  6) 1,7,7,
  </code></pre>
  
  <p>function prototype:</p>
  
  <pre><code>int findCombinationsCount(int amount, int coins[])
  </code></pre>
  
  <p>assume that coin array is sorted. for above example this function should return 6. </p>
  
  <p>Anyone guide me how to implement this??</p>