Techniqueintro
Memoization
Also called memoisation, top-down dynamic programming.
Cache the results of recursive calls so each subproblem is solved only once.
Cache the results of recursive calls so each subproblem is solved only once.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 1B1KF8 Edit this page History Report an error