Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
filetext = fileread('oddEven.m');
assert(isempty(strfind(filetext, 'regexp')),'regexp hacks are forbidden')
|
2 | Pass |
filetext = fileread('oddEven.m');
loopUsed = any(strfind(filetext, 'while')) || any(strfind(filetext, 'for'));
assert(~loopUsed, 'Loops are forbidden')
|
3 | Pass |
v = [];
w_correct = [];
assert(isequal(oddEven(v),w_correct))
n =
0
w =
[]
|
4 | Pass |
v = [2; 7; 0; 3; 2];
w_correct = [7; 3; 2; 0; 2];
assert(isequal(oddEven(v),w_correct))
n =
5
x =
5×1 logical array
1
0
1
0
1
y =
2
0
2
v =
7
3
w =
7
3
2
0
2
|
5 | Pass |
v = [1, 0, 2, 9, 3, 8, 8, 4];
w_correct = [1, 9, 3, 0, 2, 8, 8, 4];
assert(isequal(oddEven(v),w_correct))
n =
1
x =
1×8 logical array
0 1 1 0 0 1 1 1
y =
0 2 8 8 4
v =
1 9 3
w =
1 9 3 0 2 8 8 4
|
6 | Pass |
odd = 2 * randi([-4, 4], 1, randi([4,10])) - 1;
even = 2 * randi([-4, 4], 1, randi([4,10]));
v = [even, odd];
w_correct = [odd, even];
assert(isequal(oddEven(v),w_correct))
n =
1
x =
1×14 logical array
1 1 1 1 1 1 1 1 1 1 0 0 0 0
y =
6 -8 8 6 8 -8 2 6 -2 0
v =
-1 3 -3 -9
w =
-1 3 -3 -9 6 -8 8 6 8 -8 2 6 -2 0
|
239 Solvers
Similar Triangles - find the height of the tree
156 Solvers
202 Solvers
377 Solvers
122 Solvers