recursion_examples VS dynamic-programming

Here's an Python example recursive Ackermann and the iteractive Ackermann. They produce the same output.

Here's a bunch of Python recursion examples (I use these in the book): https://github.com/asweigart/recursion_examples/

Here is a recursive Ackermann function.

Here's the Ackermann function solved iteratively.

(I always get people saying, "some things do require recursion" and, no, they don't require it. Here's a non-recursive Python implementation of the famously recursive Ackermann function, and it has the same output as the normal recursive one.)

There is literally nothing that you can do with recursion that can't be done with a loop and a stack (because that's effectively what recursion is.) To prove it, here's an iterative version of the famously recursive Ackermann function. It's output is identical to this recursive implementation.

Hey, maybe this would help for DP, it's written for people who struggle to get the concept. Long but worth it. https://github.com/nobodyme/dynamic-programming