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 ...

When the recursive Java factorial program runs, it creates a stack of method calls that look like this: factorialFunction(5) factorialFunction(4) factorialFunction(3) factorialFunction(2) ...