int fact(int n)
{
if(_________)
return 1;
return n * fact(n - 1);
}
int main()
{
int n = 5;
int ans = fact(n);
printf("%d",ans);
return 0;
}
a) O(1)
b) O(n)
c) O(n2)
d) O(n3)
What is the space complexity of the following recursive implementation to find the factorial of a number?
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
What is the space complexity of the following recursive implementation to find the factorial of a number?
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!