Question: Which part of the folowing code identifies a base case for recursion? / / a method to calculate n factorial recursively / / works with

Which part of the folowing code identifies a base case for recursion?
// a method to calculate n factorial recursively
// works with positive integers up to the limit of the int data type
//12! is the limit for int data
static int factorial (int n){
if (n ==1)
return 1;
else
return n * factorial(n-1);
}// end factorial()
Group of answer choices
else return n * factorial(n-1);
//12! is the limit for int data
if (n ==1) return 1;
int i =(n-1);

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!