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 Solvers27
Suggested Problems
-
2272 Solvers
-
Cumulative product of a vector
300 Solvers
-
find whether it is prime or not
157 Solvers
-
195 Solvers
-
determine the sum of the squares
128 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.