Lecture Outline

• The change making problem is to compute the minimum number of coins needed to make P cents using a set of coin denominations [1, 5, 10, 25], for example
• We can solve the change making problem by solving smaller change making problems
• The running time for the algorithm using normal recursion is really really bad (exponential)
• Then, using the minimum number of coins needed (n), we discussed an algorithm that will generate the combinations(s) on length n that add to P using the given coin denominations (which also has really bad running time)

Lecture Recording

• https://youtu.be/qaSXx8Hc0QU

Lecture Slides

• Recursion (Part 3)

Code

• CoinFinder

Click here to return to the course schedule