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.

Curiously, many Java programmers I've met don't know of this since obviously they never applied recursion beyond say the introductory Fibonacci function and they never fed it a very big value, say ...