factorial1.java

算法设计与分析 1. 用直接递归方法计算n！： （2）通过键盘输入n的值

/**
 * @(#)Factorial1.java
 *
 *
 * @author 
 * @version 1.00 2008/10/21
 */

public class Factorial1 {
        
    /**
     * Creates a new instance of <code>Factorial1</code>.
     */
    public static int  Factorial1(int n )
        {
        	if(n==0)return 1;
        	return n+Factorial1(n-1);
        	
        }
    
    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        // TODO code application logic here
        
        
       
        System.out.println("Factorial1(12)="+Factorial1(12));
        
        
        
        
        
        
    }
}