This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
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))
odd =
[]
even =
[]
mysize =
0 0
w =
[]
|
4 | Pass |
v = [2; 7; 0; 3; 2];
w_correct = [7; 3; 2; 0; 2];
assert(isequal(oddEven(v),w_correct))
odd =
7
3
even =
2
0
2
mysize =
5 1
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))
odd =
1 9 3
even =
0 2 8 8 4
mysize =
1 8
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))
odd =
-1 -7 5 -3 -7 1 1 -3 -1 7
even =
-8 6 -6 -4 -2
mysize =
1 15
w =
-1 -7 5 -3 -7 1 1 -3 -1 7 -8 6 -6 -4 -2
|
300 Solvers
1737 Solvers
Similar Triangles - find the height of the tree
156 Solvers
Matrix with different incremental runs
194 Solvers
114 Solvers