How many ways to make change

This calculates the number of ways to make change for x dollars (using current Canadian coins).

Running this program yields that there are 242 different ways to change $1.00 CAD (292 if you're american and use half-cent coins)

If someone can better this code, I would be much obliged, as I'm still only learning Scheme and very new to it. Thanks.

Please login to post comments.

Page 1 of 1

Genetic Algorithm for solving the N-Queens problem
Converting from infix notation to prefix and postfix notation
Factoring numbers
Path Finding
Pre, in, post order traversal of a binary tree.

Splitting a list recursively in Scheme
Genetic Algorithm for solving the N-Queens problem
Converting from infix notation to prefix and postfix notation
Factoring numbers
Path Finding

Splitting a list recursively in Scheme
down the tree
Solving the N-Queens-Problem Part I
Factoring numbers
Filtered Accumulator