再帰的にnの階乗を求める-Java言語の説明

public class RecursiveAlgorithm {
	StringBuffer buffer = new StringBuffer();
	public int factorial(int n) {
		if (n <= 1) {
			buffer.append(n);
			System.out.println(buffer.toString());
			return 1;
		}
		buffer.append(n).append(" * ");
		return n * factorial(n - 1);
	}
}

public class Test {
	public static void main(String[] args) {
		RecursiveAlgorithm recursive = new RecursiveAlgorithm();
		int pruduct = recursive.factorial(12);
		System.out.println("pruduct="+ pruduct);
	}
}

再帰的に階乗出力を求める結果:
12 * 11 * 10 * 9 * 8 * 7 * 6 * 5 * 4 * 3 * 2 * 1
pruduct=479001600
 
Hello , World !
すべてに感謝します!