Sail E0 Webinar
Question
What is the space complexity of the above recursive implementation to find the factorial of a number?
Options:
A .  O(1)
B .  O(n)
C .  O(n2)
D .  O(n3)
Answer: Option A


The space complexity of the above recursive implementation to find the factorial of a number is O(1).



Was this answer helpful ?
Next Question

Submit Solution

Your email address will not be published. Required fields are marked *

More Questions on This Topic :


Latest Videos

Latest Test Papers