I had to laugh hard the first time I heard about it, I mean it's a really obvious technique if you've ever done low-level programming on limited machines as it's very close to something we used to do all the time - calculate result tables and use lookups which we built in to our code.
Trades memory for CPU when it's worth it. Dynamic programming takes the same idea but does it at runtime.
To be fair, DP generally also involves recursion in some way. You could describe it as a lookup table where, to fill in later entries of the table, you need to use the earlier entries.
Trades memory for CPU when it's worth it. Dynamic programming takes the same idea but does it at runtime.