Which statement correctly describes the base case in a recursive factorial function?

Options

  • A. It makes the function call itself forever
  • B. It stops further recursive calls
  • C. It always returns n multiplied by itself
  • D. More than one of the above
  • E. None of the above

Correct Answer (Detailed Explanation is Below)

B. It stops further recursive calls

Detailed Explanation

Correct Answer: Option B

Explanation:
A base case terminates the recursion. In a factorial function, a common base case is if (n <= 1) return 1;. Without a reachable base case, recursion may continue until resources are exhausted.
← Previous Next →

Attempt Quiz Now:

TRE4 C and C++ Quiz practice set 3

Feature Posts