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 =
360
|
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 =
445
|
6 | Pass |
m=2;
n=randi(128)
Ack = 2*n+3;
assert(isequal(ackermann(m,n),Ack))
n =
92
|
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 =
4
|
9 | Pass |
m=4;
n=0;
Ack = 13;
assert(isequal(ackermann(m,n),Ack))
|
10 | Pass |
m=4;
n=1; % Fails at RecursionLimit 1030; Create Special
Ack = 65533;
assert(isequal(ackermann(m,n),Ack))
|
6281 Solvers
Project Euler: Problem 6, Natural numbers, squares and sums.
1018 Solvers
260 Solvers
Side of an equilateral triangle
2595 Solvers
98 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!