Category:Memoization: Difference between revisions
Content added Content deleted
(added cat:encyclopedia) |
|||
Line 14: | Line 14: | ||
The overall benefit is that a function frequently called with the same set of inputs can save time by remembering the answer after computing it once -- sacrificing memory for computation time. In systems where memory (or storage depending on the implementation of storing old results) comes at a premium, memoization is not a good option. As long as memory is available and input sets are used repeatedly, memoization can save lots of computation time. |
The overall benefit is that a function frequently called with the same set of inputs can save time by remembering the answer after computing it once -- sacrificing memory for computation time. In systems where memory (or storage depending on the implementation of storing old results) comes at a premium, memoization is not a good option. As long as memory is available and input sets are used repeatedly, memoization can save lots of computation time. |
||
[[Category:Classic CS problems and programs]] |
[[Category:Classic CS problems and programs]] |
||
[[Category:Encyclopedia]] |