Skip to content

Update 08_dynamic_programming.md #28

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
Denis-Kazakov wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Update 08_dynamic_programming.md #28

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion prose/08_dynamic_programming.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -54,7 +54,7 @@ print(recMC([1, 21, 25],63))
print(recMC([1, 5, 21, 25],63))
```

This works, but it's very slow. A natural thing to try here is to **memoize** solutions from previous recursive calls.
This works, but it's very slow. (We assume that a solution exists and the smallest coin value is 1. Otherwise the above code will give the same answer for recMC([1, 21, 25],63) and recMC([2, 21, 25],63).) A natural thing to try here is to **memoize** solutions from previous recursive calls.
This way, we don't repeat work by computing the number of coins for a specific amount of change more than one time.
Don't forget to pass along the dictionary of known results when making recursive calls.

Expand Down