[TBD]Coin change problem

Problem statement

Given a value N, if we want to make change for N cents, and we have infinite supply of each of S = { S1, S2, .. , Sm} valued coins, how many ways can we make the change? The order of coins doesn’t matter.

Reference

http://www.geeksforgeeks.org/dynamic-programming-set-7-coin-change/