Recursion-1 > factorial

Given n of 1 or more, return the factorial of n, which is n * (n-1) * (n-2) … 1. Compute the result recursively (without loops).

factorial(1) → 1  
factorial(2) → 2  
factorial(3) → 6  

Solution

public int factorial(int n) {
  
  if(n==1 || n==0)
   return 1;
  else
   return n*factorial(n-1);
}
Reactions

Post a Comment

0 Comments

Close Menu