diff --git a/pretext/Recursion/DynamicProgramming.ptx b/pretext/Recursion/DynamicProgramming.ptx index b36389b7..86e16e48 100755 --- a/pretext/Recursion/DynamicProgramming.ptx +++ b/pretext/Recursion/DynamicProgramming.ptx @@ -162,7 +162,7 @@ main() minimum, we first check the table to see if a result is already known. If there is already a result in the table, we use the value from the table rather than recomputing. This technique is called - memorizationmemoization + memoizationmemoization and is a very useful method for speeding up frequent yet hardware-demanding function calls. shows a modified algorithm to incorporate our table lookup scheme.