Exam 14: Recursion

Given the following code that uses recursion to find the factorial of a number, how many times will the else clause be executed if n = 5? private static int factorial(int n) { If (n == 0) Return 1; Else Return n * factorial(n - 1); }

Whereas a recursive algorithm might result in faster execution time, the programmer might be able to design an iterative algorithm faster.

The actions performed by the JVM that take place with each method call are sometimes referred to as

The recursive binary search algorithm is a good example of repeatedly breaking a problem down into smaller pieces until it is solved.