else { return n * factorialFunction(n – 1); } }} Notice how the recursive Java factorial function does not need an iterative loop. Instead, the code repeatedly calls itself until a stop condition is ...

Recursion has more expressive power than iterative looping constructs. I say this because a while loop is equivalent to a tail recursive function ... and move between different manifestations ...