120 likes | 343 Views
The Change Problem. Given a set of coinsFind the minimum number of coins to make a given amount. Brute Force (Recursive) Solution. Find_change (amt){ if ((amt) < 0) return infinity else if (amt = 0) return 0 else best = infinity For each coin in the set result
E N D