using matlab wi looking like. cm3· The Ackermann function. A, is a qu ickly grow

Question

using matlab

wi looking like. cm3· The Ackermann function. A, is a qu ickly growing function that is defined by the recursive relationship: 1l If m =0 A(m, n) = A(m-1,1) If m > 0and n =r A(m 1, A(m, n 1)) if m> 0and n > 0 myAckermann (m, n ) , where A is the Ackermann func- rite a function with header [A] tion computed for m and n. Test Cases: = >AmyAckermann (1,1) A= >> A = myAckermann (1,2) >> A = myAckermann (2,3) >> A-myAckermann (3,3) 61 >> A = myAckermann (3,4) 125

Explanation / Answer

myAckermann.m

function A = myAckermann(m, n)
if (m == 0)
A = n+1;
elseif (m > 0 && n == 0)
A = myAckermann(m-1, 1);
elseif (m > 0 && n > 0)
A = myAckermann(m-1, myAckermann(m, n-1));
end
end

on console

A = myAckermann(1,1)

A = 3
A = myAckermann(1,2)

A = 4
A = myAckermann(2,3)

A = 9
A = myAckermann(3,3)

A = 61
A = myAckermann(3,4)

A = 125

Related Questions

Navigate

• Browse (All)
• Browse U
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.