Hooray for ambiguous classing requirements.
How about this for the "best" solution:
x_odd = x(is_it_odd(x)); % :/
The answer should be logical(mod(n,2)).
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
n = 1;
ans_correct = true;
assert(isequal(is_it_odd(n),ans_correct))
|
2 | Pass |
%%
n = 2;
ans_correct = false;
assert(isequal(is_it_odd(n),ans_correct))
|
3 | Pass |
%%
n = 28;
ans_correct = false;
assert(isequal(is_it_odd(n),ans_correct))
|
4 | Pass |
%%
n = 453;
ans_correct = true;
assert(isequal(is_it_odd(n),ans_correct))
|
5 | Pass |
%%
n = 17;
ans_correct = true;
assert(isequal(is_it_odd(n),ans_correct))
|
6 | Pass |
%%
n = 16;
ans_correct = false;
assert(isequal(is_it_odd(n),ans_correct))
|
Back to basics 3 - Temp Directory
328 Solvers
Duplicate each element of a vector.
518 Solvers
724 Solvers
Find nearest prime number less than input number
268 Solvers
359 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!