and of course loops and recursion—and you have to bring the mental flexibility to the table that allows you to approach a problem from two radically different angles, and move between different ...

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