Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = [2 6 4 9 -10 3 1 5 -10];
y_correct = 5;
assert(isequaln(n_max(x,3),y_correct))
y =
5
|
2 | Pass |
x = [2 6 4 9 -10 3 1 5 -10];
y_correct = NaN;
assert(isequaln(n_max(x,13),y_correct))
y =
NaN
|
3 | Pass |
x = [0 0 0 -2 0 -6];
y_correct = -2;
assert(isequaln(n_max(x,5),y_correct))
y =
-2
|
4 | Pass |
x = [1 1 1 1 1 1];
y_correct = 1;
assert(isequaln(n_max(x,4),y_correct))
y =
1
|
5 | Pass |
x = [1 1 1 1 1 1];
y_correct = NaN;
assert(isequaln(n_max(x,14),y_correct))
y =
NaN
|
729 Solvers
Project Euler: Problem 10, Sum of Primes
555 Solvers
367 Solvers
Back to basics 19 - character types
189 Solvers
221 Solvers