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 |
x = [0 1 2 3 4];
assert(isequal(mono_increase(x),true));
ans =
logical
1
|
2 | Pass |
x = [0];
assert(isequal(mono_increase(x),true));
ans =
logical
1
|
3 | Pass |
x = [0 0 0 0 0];
assert(isequal(mono_increase(x),false));
ans =
logical
0
|
4 | Pass |
x = [0 1 2 3 -4];
assert(isequal(mono_increase(x),false));
ans =
logical
0
|
5 | Pass |
x = [-3 -4 2 3 4];
assert(isequal(mono_increase(x),false));
ans =
logical
0
|
6 | Pass |
x = 1:.1:10;
assert(isequal(mono_increase(x),true));
ans =
logical
1
|
7 | Pass |
x = cumsum(rand(1,100));
x(5) = -1;
assert(isequal(mono_increase(x),false));
ans =
logical
0
|
8 | Pass |
x = cumsum(rand(1,50));
assert(isequal(mono_increase(x),true));
ans =
logical
1
|
1166 Solvers
Given a 4x4 matrix, swap the two middle columns
301 Solvers
145 Solvers
302 Solvers
105 Solvers