News for hackers. Stuff that matters.

A comment on Dynamic Progamming: First Principles. Parent comment

Re:Dynamic Progamming: First Principles by misja111 on Wednesday October 25, 2017 @10:17AM (#15550287)
> This is why it can be considered memoization: each recursive call builds on the "stored" finished result of the previous call.

Ok, but isn't this then also the case for non-tail recursive calls? And ordinary recursive call builds just as well on the finished result of the previous call and no result is really "stored" in either case.

[ Parent | on HN ]
Re:Dynamic Progamming: First Principles by ohkaiby on Wednesday October 25, 2017 @10:33AM (#15550425)
No, if you look at vanderZwan's explanation for the non-tail recursive call, you'll see that it doesn't build on a finished result of the previous call.

> You have to recurse until you reach n == 0, and only then does the whole sum "collapse".

[ Parent | on HN ]