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
-
Sort a list of complex numbers based on far they are from the origin.
5821 Solvers
-
Maximum running product for a string of numbers
2259 Solvers
-
930 Solvers
-
Check if number exists in vector
14572 Solvers
-
Integer Sequence - II : New Fibonacci
702 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.