It's pretty common to see the factorial algorithm used as an example of how to reduce the overhead of recursion, but I would like to know how you could do this with the recursive fibonacci algorithm.

In mathematics and computer science, recursion is a way of specifying something (usually a mathematical object or part of a computer program) by reference to itself. More precisely (and to dispel the ...