Hacker News new | ask | show | jobs
by HarHarVeryFunny 336 days ago
With dynamic programming the order of computation isn't necessarily fixed, even though you can sometimes order it to reduce or eliminate recursion. You are just reusing past results when they exist, else computing and storing if they don't.