/**
* Factorial 를 재귀적 함수 형태로 구현한다.
*/
package net.wiseant.test.algorithm.number;
/**
* @author Sang-Hyup Lee
* @version 1.0
*
*/
public class FactorialRecursive {
int res;
int factorial(int n) {
if ( n <= 1 )
res = 1;
else
res = n * factorial(n-1);
// System.out.print("print_1 : " + res + ", ");
return res;
}
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
FactorialRecursive obj = new FactorialRecursive();
int temp;
temp = obj.factorial(5);
System.out.println("end_of_program : " + temp);
}
}
댓글 없음:
댓글 쓰기