This Q&A is part of a weekly series of posts highlighting common questions encountered by technophiles and answered by users at Stack Exchange, a free, community-powered network of 100+ Q&A sites.

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.

When studying programming, you notice something strange.Processes that are extremely complex for humans to think through can sometimes be written surprisingly concisely using functions.A prime example ...