Skip to content

Update intro-to-dp.md #1405

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

Merged
merged 1 commit into from
Dec 30, 2024
Merged

Update intro-to-dp.md #1405

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 src/dynamic_programming/intro-to-dp.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -107,7 +107,7 @@ Of course, as written, this is a bit silly for two reasons:
Firstly, we do repeated work if we call the function more than once.
Secondly, we only need to use the two previous values to calculate the current element. Therefore, we can reduce our memory from $O(n)$ to $O(1)$.

An example of a bottom-up dynamic programming solution for fibonacci which uses $O(1)$ might be:
An example of a bottom-up dynamic programming solution for fibonacci which uses $O(1)$ memory might be:

```cpp
const int MAX_SAVE = 3;
Expand Down
Loading