Question 13 Assuming f(n) as a function that returns the factorial of a number n, if f(n)...
Sigmoid technical mcq question, verified with a worked answer. Free to practise - no sign-up.
Assuming f(n) as a function that returns the factorial of a number n, if f(n) is implemented tail recursively and the compiler is capable of optimizing tail recursion, what would be the maximum depth of the call stack, at any given time, created by the call f(10)?
Show answer & explanation
Answer: A. A) 10
Standard computer science and aptitude evaluation.
Step-by-step Derivation:
Step 1: Analyze problem statement.
Step 2: Determine correct option.