Recursion-1 > factorial
prev  |  next  |  chance

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 ...Save, Compile, Run          Show Hint Show Solution public int factorial(int n) { } See Also: Example Code Java help: If Boolean Logic | Strings | While and For Loops | Arrays and Loops prev  |  next  |  chance   |  JavaBat  >  Recursion-1

Forget It! -- delete my code for this problem 303.0

Copyright Nick Parlante 2006-09 - privacy