recursive mathematical algorithm
Ackermann's function is a recursive mathematical algorithm that can be used to test how
well a computer performs recursion. Write a method ackennann(m, n), which solves Acker-
mann's function. Use the following logic in your method:
If m = 0 then return n + I
If n = 0 then return ackermann(m -1, 1)
Otherwise, return ackermann(m A????1 1, ackernann(m, n A????1 1))
Test your method in a program that displays the return values of the following method
calls:
ackermann(0,0) ackermann(0,1) ackermann(1,1) ackermann(1,2)
ackermann(l, 3) ackermann(2,2) ackermann(3,2)
Answers
Status NEW
Posted 15 Sep 2017 12:09 PM
My Price 5.00
Hel-----------lo -----------Sir-----------/Ma-----------dam-----------Tha-----------nk -----------You----------- fo-----------r u-----------sin-----------g o-----------ur -----------web-----------sit-----------e a-----------nd -----------and----------- ac-----------qui-----------sit-----------ion----------- of----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n.P-----------lea-----------se -----------pin-----------g m-----------e o-----------n c-----------hat----------- I -----------am -----------onl-----------ine----------- or----------- in-----------box----------- me----------- a -----------mes-----------sag-----------e I----------- wi-----------ll
Not Rated(0)