@@ -0,0 +1,691 @@
+package codingbat.recursion1;%0A%0A/*%0A * Given n of 1 or more, return the factorial of n, %0A * which is n * (n-1) * (n-2) ... 1. %0A * Compute the result recursively (without loops). %0A * %0A * factorial(1) = 1%0A * factorial(2) = 2%0A * factorial(3) = 6%0A */%0A%0Apublic class factorialTest %7B%0A  %0A  public static void main(String%5B%5D args) %7B%0A    factorialTest test = new factorialTest();%0A%0A    System.out.println(%22%3E%22 + test.factorial(1) + %22%3C%22);%0A    System.out.println(%22%3E%22 + test.factorial(2) + %22%3C%22);%0A    System.out.println(%22%3E%22 + test.factorial(3) + %22%3C%22);%0A    System.out.println(%22%3E%22 + test.factorial(13) + %22%3C%22);%0A  %7D%0A%0A  public int factorial(int n) %7B%0A    if (n==1) return 1;%0A    %0A    return n*factorial(n-1);%0A  %7D%0A%0A%7D%0A

add task factorial