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.

Hi guys. I'm new here. I've joined these forums due to a recommendation from a friend of mine. He says that you guys here can offer some good programming repair work if guys like me are in trouble.