Category:Memoization: Difference between revisions
added Encyclopedia tag
m (A little more info, organization) |
(added Encyclopedia tag) |
||
(5 intermediate revisions by 3 users not shown) | |||
Line 1:
Memoization is a method used to reduce function calls in recursive functions or other functions that are called very frequently. The basic idea behind memoizing is to store results for new sets of inputs (typically in a key-value style) so that the function will not have to re-
Functions which can be memoized are ones that give the same answer for a set of inputs each time those inputs are used. [[Fibonacci sequence|Fibonacci number functions]] are often memoized to reduce their call trees and calculation times over time. The basic operation of a memoized function would look something like this:
Line 7:
else
compute the answer for inputs
store that (inputs, answer) pair
return that answer
end function</pre>
Some programs may negate the condition in the "if" and swap the operations.
The overall benefit is that a function
[[Category:Classic CS problems and programs]] [[Category:Encyclopedia]]
|