Merge pull request #116 from nbro/issue-115-docstring-typo

Fix typo in andz/algorithms/dp/fibonacci.py
nbro · Aug 28, 2024 · 8cad0d5 · 8cad0d5
2 parents 1dd31b8 + 35f916e
commit 8cad0d5
Showing 1 changed file with 1 addition and 1 deletion.
diff --git a/andz/algorithms/dp/fibonacci.py b/andz/algorithms/dp/fibonacci.py
@@ -33,7 +33,7 @@
 compute fib(4) and fib(3). To compute fib(4), we would need to compute fib(3)
 and fib(2). So, we would compute fib(3) twice.
 
-To solve this problem, once we compute fib(3), we can solve the result. This is
+To solve this problem, once we compute fib(3), we can save the result. This is
 called memoization.
 
 The time complexity of memoized_fibonacci (below) is linear because we need