From 5d6273b7fe9e99902beae06e4e7c65c635ce9e67 Mon Sep 17 00:00:00 2001 From: Jet Hughes Date: Sat, 11 Jun 2022 13:02:26 +1200 Subject: [PATCH] vault backup: 2022-06-11 13:02:26 --- content/notes/dynamic-programming.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/content/notes/dynamic-programming.md b/content/notes/dynamic-programming.md index e82062bf4..b8e5057a3 100644 --- a/content/notes/dynamic-programming.md +++ b/content/notes/dynamic-programming.md @@ -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) {