Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

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.


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: