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 Solvers28
Suggested Problems
-
558 Solvers
-
Find and replaces spaces from a input string with *
172 Solvers
-
Find the area of the four walls
294 Solvers
-
Check that number is whole number
5431 Solvers
-
6287 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.