Home / MCQ Bank / Computer
Computer Miscellaneous On Data Structures Difficulty: Medium

What is the space complexity of the following recursive implementation to find the factorial of a number? 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; }

Select the correct option to test your answer:

More Computer Questions

What does that acronym EGA stand for? Which of the following is an incorrect statement about packages? How many arguments can be passed to main()? In Java, which classes are used for autoboxing and unboxing operations? The SQL command to create a table is: