ackerman.java

来自「《算法设计与分析》王晓东编著」· Java 代码 · 共 25 行

import java.util.Scanner;
public class Ackerman {

	/**
	 * @param args
	 */
	public static int ackerman(int n,int m){
		if(n==0 && m>=0) return 1;
		if(n==1 && m==0) return 2;
		if(n>=2 && m==0) return n+2;
		int x = ackerman(n-1,m);
		return ackerman(x,m-1);
	}
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in = new Scanner(System.in);
		System.out.print("Ackerman(n,m):\nn = ");
		int n = in.nextInt();
		System.out.print("m = ");
		int m = in.nextInt();
		System.out.print("Ackerman("+n+","+m+") = "+ackerman(n,m));
	}

}