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
-
Find the longest sequence of 1's in a binary sequence.
6802 Solvers
-
781 Solvers
-
249 Solvers
-
6273 Solvers
-
Find the Oldest Person in a Room
20927 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.