Simple recursive Fibonaci example. How to make it faster?

Feels like Ackerman’s function would be better suited and cause less questions like this.

6 Likes