0%
0 / 25 answered
Practice Test 10
•25 QuestionsQuestion
1 / 25
Q1
For factorial(5) below, how many recursive calls are made before the base case returns?
int factorial(int n) {
if (n <= 1) return 1; // base case
return n * factorial(n-1); // recursive case
}
```
For factorial(5) below, how many recursive calls are made before the base case returns?
int factorial(int n) {
if (n <= 1) return 1; // base case
return n * factorial(n-1); // recursive case
}
```