Cody

Problem 734. Ackermann's Function

Solution 429280

Submitted on 9 Apr 2014 by J.R.! Menzinger
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

Test Status Code Input and Output
1   Pass
%% m=0; n=1; Ack = n+1; assert(isequal(ackermann(m,n),Ack))

ans = 2

2   Pass
%% m=0; n=1024; Ack = n+1; assert(isequal(ackermann(m,n),Ack))

ans = 1025

3   Pass
%% m=0; n=randi(1024) Ack = n+1; assert(isequal(ackermann(m,n),Ack))

n = 50 ans = 51

4   Pass
%% m=1; n=1024 Ack = n+2; assert(isequal(ackermann(m,n),Ack))

n = 1024 ans = 1026

5   Pass
%% m=1; n=randi(1024) Ack = n+2; assert(isequal(ackermann(m,n),Ack))

n = 813 ans = 815

6   Pass
%% m=2; n=randi(128) Ack = 2*n+3; assert(isequal(ackermann(m,n),Ack))

n = 65 ans = 133

7   Pass
%% m=3; n=6; Ack = 509; assert(isequal(ackermann(m,n),Ack))

ans = 509

8   Pass
%% m=3; n=randi(6) Ack = 2^(n+3)-3; assert(isequal(ackermann(m,n),Ack))

n = 4 ans = 125

9   Pass
%% m=4; n=0; Ack = 13; assert(isequal(ackermann(m,n),Ack))

ans = 13

10   Pass
%% m=4; n=1; % Fails at RecursionLimit 1030; Create Special Ack = 65533; assert(isequal(ackermann(m,n),Ack))

ans = 65533

Suggested Problems

More from this Author246

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!