I am working on a project for my assembly language programming class and the prof has us writing a program to calculate fibonacci numbers but we need to make only 1 recursive call. Here is my ...

Also, a recursive algorithm can always be implemented iteratively by using an explicit stack. Finally, I'd note that a five-line solution is probably always better than a 100 line one ...