id/email
password
forgot password | create account
about | help | code help+videos | done | prefs
CodingBat code practice

 

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 (ctrl-enter)

public int factorial(int n) { }

Editor font size %:
Shorter output


Forget It! -- delete my code for this problem

Progress graphs:
 Your progress graph for this problem
 Random user progress graph for this problem
 Random Epic Progress Graph

Java Help

Misc Code Practice

Difficulty: 303.0 Post-solution available

Copyright Nick Parlante 2017 - privacy