whyyyyy
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
n = 1;
ans_correct = true;
assert(isequal(is_it_odd(n),ans_correct))
tf =
logical
1
|
2 | Fail |
n = 2;
ans_correct = false;
assert(isequal(is_it_odd(n),ans_correct))
tf =
logical
1
|
3 | Fail |
n = 28;
ans_correct = false;
assert(isequal(is_it_odd(n),ans_correct))
tf =
logical
1
|
4 | Pass |
n = 453;
ans_correct = true;
assert(isequal(is_it_odd(n),ans_correct))
tf =
logical
1
|
5 | Pass |
n = 17;
ans_correct = true;
assert(isequal(is_it_odd(n),ans_correct))
tf =
logical
1
|
6 | Fail |
n = 16;
ans_correct = false;
assert(isequal(is_it_odd(n),ans_correct))
tf =
logical
1
|
8410 Solvers
2110 Solvers
403 Solvers
07 - Common functions and indexing 6
282 Solvers
Sum of odd numbers in a matrix
232 Solvers