Write the ackerman function, which conforms to 3 constraints:
ack(0, n) = n+1
ack(m, 0) = ack(m-1, 1)
ack(m, n) = ack(m-1, ack(m, n-1))
Solution Stats
Problem Comments
1 Comment
Solution Comments
Show comments
Loading...
Problem Recent Solvers29
Suggested Problems
-
7527 Solvers
-
Omit columns averages from a matrix
620 Solvers
-
Sum all integers from 1 to 2^n
17961 Solvers
-
742 Solvers
-
195 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
See also Cody Problem 734.