ackerman.java

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

/**
 * @(#)Ackerman.java
 *
 *
 * @author 
 * @version 1.00 2008/10/22
 */
import java.util.Scanner;
public class Ackerman {
        
    /**
     * Creates a new instance of <code>Ackerman</code>.
     */
    public static int Ackerman(int n,int m) {
    	if(n==1&&m==0)return 2;
    	if(n==0&&m>=0)return 1;
    	if(m==0&&n>=2)return n+2;
    	return  Ackerman(Ackerman(n-1,m),m-1);
    }
    
    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) 
        // TODO code application logic here
    {     int n=0;
        Scanner   scan=new  Scanner(System.in);
        System.out.print("input n=");
        n=scan.nextInt();
        int m=0;
        System.out.print("input m=");
        m=scan.nextInt();
        System.out.println("The Ackerman is:"+Ackerman(n,m));
   
    }
}