memoization
RU: мемоизация
The top-down way to write dynamic programming: take the natural recursive solution and add a cache that stores each answer the first time it is computed. Recursion stays the same, but already-solved subproblems are not solved again, turning fib(30) from about 2.7 million calls into 59.