1 2 3 4 5 6 7 8 9 10 11
package com.example; public class RecursiveFactorial { public static int factorial(int n) { if (n == 1) { return 1; } else { return n * factorial(n - 1); } } }