GitHub/quartz
1
0
Fork 2
mirror of https://github.com/jackyzha0/quartz.git synced 2025-12-24 13:24:05 -06:00
Code Issues Actions Packages Projects Releases Wiki Activity

vault backup: 2022-06-11 13:02:26

Browse Source
This commit is contained in:
Jet Hughes 2022-06-11 13:02:26 +12:00
parent c2de3b2c50
commit 5d6273b7fe
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
content/notes/dynamic-programming.md
View File

@ -26,7 +26,7 @@ public long fibDP (int n) {
A similar effect can be achieved using *memoization* (caching)
# DP vs memoization
A DP algorithm will typically compute *all* simpler versions of the problem. When this is neccessary then DP will be faster. However if only a small proportion of the simpler cases are actually needed it may be better to use memoization. Sometimes we can reduct the storage need for DP too. e.g., in the following fibonacci example
A DP algorithm will typically compute *all* simpler versions of the problem from the bottom up. When this is neccessary then DP will be faster. However if only a small proportion of the simpler cases are actually needed it may be better to use memoization. Sometimes we can reduct the storage need for DP too. e.g., in the following fibonacci example
```java
public long fibDP (int n) {