When the condition that marks the end of recursion is met, the stack is then unraveled from the bottom to the top, so factorialFunction(1) is evaluated first, and factorialFunction(5) is evaluated ...

Recursive functions that use mutable data Ideally, you'd use the least expressive constructs that you can. Of course, if your language doesn't support tail call optimization, then that may also ...