Noun
memoization (uncountable)
(computer science) A technique in which partial results are recorded (forming a memo) and then can be re-used later without having to recompute them.
In order to avoid an operation with an costs, the algorithm uses laziness with memoization, and force the rebalancing to be partly done during the following operations, that is, before the following rebalancing. Source: Internet
By using memoization or maintaining a table of subproblems already solved, dynamic programming reduces the exponential nature of many problems to polynomial complexity. Source: Internet
When subproblems are independent and there is no repetition, memoization does not help; hence dynamic programming is not a solution for all complex problems. Source: Internet
The second one, with no lazy lists nor memoization is presented at the end of the sections. Source: Internet