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.

The first list of instructions is obeyed on the way up the spiral i.e. as the instances of the function are being built and the second list is obeyed on the way back down the spiral as the instances ...

At a job interview on Friday, I had to write code, and one of the things that came up when we were talking about implementation of a concept was recursion. The director of the group said to me "Don't ...