Ackerman’s number, used in mathematical logic, can be calculated using the formula shown in Figure 2-17. Write a recursive algorithm that calculates Ackerman’s number. Verify your algorithm by using it to manually calculate the following test cases: Ackerman(2, 3), Ackerman(2, 5), Ackerman(0, 3), and Ackerman(3, 0).
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here