Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
m=0;
n=1;
Ack = n+1;
assert(isequal(ackermann(m,n),Ack))
|
2 | Pass |
m=0;
n=1024;
Ack = n+1;
assert(isequal(ackermann(m,n),Ack))
|
3 | Pass |
m=0;
n=randi(1024)
Ack = n+1;
assert(isequal(ackermann(m,n),Ack))
n =
823
|
4 | Pass |
m=1;
n=1024
Ack = n+2;
assert(isequal(ackermann(m,n),Ack))
n =
1024
|
5 | Pass |
m=1;
n=randi(1024)
Ack = n+2;
assert(isequal(ackermann(m,n),Ack))
n =
590
|
6 | Pass |
m=2;
n=randi(128)
Ack = 2*n+3;
assert(isequal(ackermann(m,n),Ack))
n =
60
|
7 | Pass |
m=3;
n=6;
Ack = 509;
assert(isequal(ackermann(m,n),Ack))
|
8 | Pass |
m=3;
n=randi(6)
Ack = 2^(n+3)-3;
assert(isequal(ackermann(m,n),Ack))
n =
1
|
9 | Pass |
m=4;
n=0;
Ack = 13;
assert(isequal(ackermann(m,n),Ack))
ans =
logical
1
|
10 | Pass |
m=4;
n=1; % Fails at RecursionLimit 1030; Create Special
Ack = 65533;
assert(isequal(ackermann(m,n),Ack))
ans =
logical
1
|
Swap the first and last columns
12413 Solvers
519 Solvers
516 Solvers
253 Solvers
2336 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!