Recursive Example : factorial
n! = n * (n-1) * (n-2) * . . . * 1
public int factorial(int n) {
int factOfN = 1 ;
for (int i = n; i >= 1; i--)
factOfN *= i ;
return i ;
}
Previous slide
Next slide
Back to first slide
View graphic version