Ackermann's Function
Ackermann’s Function is a recursive mathematical algorithm that can be used to test how well a system optimizes its performance of recursion. Design a function ackermann(m, n), which solves Ackermann’s function. Use the following logic in your function:
If m = 0 then return n + 1 If n = 0 then return ackermann(m — 1, 1) Otherwise, return ackermann(m — 1, ackermann(m, n — 1))
Once you’ve designed your function, test it by calling it with small values for m and n.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.