Test | Status | Code Input and Output |
---|---|---|
1 | Fail |
m=0;
n=1;
Ack = n+1;
assert(isequal(ackermann(m,n),Ack))
vAck =
1
|
2 | Fail |
m=0;
n=1024;
Ack = n+1;
assert(isequal(ackermann(m,n),Ack))
vAck =
512
|
3 | Fail |
m=0;
n=randi(1024)
Ack = n+1;
assert(isequal(ackermann(m,n),Ack))
n =
509
vAck =
508
|
4 | Fail |
m=1;
n=1024
Ack = n+2;
assert(isequal(ackermann(m,n),Ack))
n =
1024
vAck =
512
|
5 | Fail |
m=1;
n=randi(1024)
Ack = n+2;
assert(isequal(ackermann(m,n),Ack))
n =
947
vAck =
946
|
6 | Fail |
m=2;
n=randi(128)
Ack = 2*n+3;
assert(isequal(ackermann(m,n),Ack))
n =
28
vAck =
12
|
7 | Fail |
m=3;
n=6;
Ack = 509;
assert(isequal(ackermann(m,n),Ack))
vAck =
2
|
8 | Fail |
m=3;
n=randi(6)
Ack = 2^(n+3)-3;
assert(isequal(ackermann(m,n),Ack))
n =
5
vAck =
4
|
9 | Fail |
m=4;
n=0;
Ack = 13;
assert(isequal(ackermann(m,n),Ack))
vAck =
0
|
10 | Fail |
m=4;
n=1; % Fails at RecursionLimit 1030; Create Special
Ack = 65533;
assert(isequal(ackermann(m,n),Ack))
vAck =
1
|
Create a cell array out of a struct
508 Solvers
The Hitchhiker's Guide to MATLAB
2874 Solvers
110 Solvers
125 Solvers
184 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!