1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 #lang sicp (define (cc amount coin-values) (cond ((= amount 0) 1) ((or (< amount 0) (no-more? coin-values)) 0) (else (+ (cc amount (except-first-denomination coin-values) ) (cc (- amount (first-denomination coin-values) ) coin-values ) ) ) ) ) (define first-denomination car) (define except-first-denomination cdr) (define no-more? null?)
Order of coins does not matter. If order of coin had any role then they should have also effected to the original solution which does
not use list because there also
first-denomination returns value of coin corresponding to a number.
To understand why it does not depend on order, we shall outline the approach to find total ways for change for amount using given denominations:
Lets take any random denomination, say from . Now total number of ways is the sum of:
- number of ways for coin-change for amount, , without using denomination . Thus we are using denominations: .
- number of ways for coin-change for amount, , using denominations .
Thus we choose any random denomination and proceed recursively. Since we are free to choose any denomination, we proceed choosing the first from the list as it helps in simplifying our procedure.