Simple Java program to demonstrate recursive Ackermann function.

import java.util.Scanner;

// 2018 TheFlyingKeyboard and released under MIT License
// theflyingkeyboard.net
public class Main {
    public static void main(String[] args) {
        Scanner reader = new Scanner(System.in);
        int m;

        System.out.println("Enter m: ");
        m = reader.nextInt(); //Reads integer from keyboard

        int n;

        System.out.println("Enter n: ");
        n = reader.nextInt(); //Reads integer from keyboard

        System.out.println("ackermann(" + m + ", " + n + ") = " + ackermann(m, n));
    }

    private static int ackermann(int m, int n){
        if(m == 0){
            return  n + 1;
        }

        if(n == 0){
            return ackermann(m - 1, 1);
        }

        return ackermann(m - 1, ackermann(m, n - 1));
    }
}

 



Java Ackermann Function
Tagged on:     

Leave a Reply

Your email address will not be published. Required fields are marked *

By continuing to use the site, you agree to the use of cookies. You can read more about it the Cookies&Privacy Policy Section Above. more information

The cookie settings on this website are set to "allow cookies" to give you the best browsing experience possible. If you continue to use this website without changing your cookie settings or you click "Accept" below then you are consenting to this. You can read more about it the Cookies&Privacy Policy Section.

Close