For Part 11, class called AckermannDemo

Subject:Computer SciencePrice:3.86 Bought8

Share With

For Part 11, class called AckermannDemo.3ava that calls the Ackermann's method.

The Ackermann function is a recursive mathematical algorithm that can be used to test how well a

computer performs recursion. method called ackermann (m, n), which solves Ackermann's

function. Use the following logic in your method

 

if m= O then return n +1

ifn 0 then retun ackermann (m-1,1)

Otherwise, return ackermann (m-1, ackermann (m, n-1))

 

Test your method in the AckermannDemo program that displays the return values of the following calls

a ackermann(0. 0)

 

b) ackermann(0, 1)

c) ackermann(1, 1)

dj ackermann(1, 2)

e) ackermann(1, 3)

fackermann(2, 2)

g) ackermann (3, 2)

h) ackermann(50, 2)

) ackermann (2, 50)

 

Here is an example of a AckermannDemo run with three different values for m and n. Explain the

results in a pdf document called resultsAnalysis.pdf for cases h) and i) above about why you get the

results obtained (L.e. what is happening in the computer?)

 

>Running ackermann samples:

ackermann(®?, 1) 2

ackermann (1, 1) 3

ackermann(1, 2) 4 and so on