Clever although slow
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = [0 1 2 3 4];
assert(isequal(mono_increase(x),true));
|
2 | Pass |
x = [0 1 2 3 -4];
assert(isequal(mono_increase(x),false));
|
3 | Pass |
x = [-3 -4 2 3 4];
assert(isequal(mono_increase(x),false));
|
4 | Pass |
x = 1:.1:10;
assert(isequal(mono_increase(x),true));
|
5 | Pass |
x = cumsum(rand(1,100));
x(5) = -1;
assert(isequal(mono_increase(x),false));
|
6 | Pass |
x = cumsum(rand(1,50));
assert(isequal(mono_increase(x),true));
|
2261 Solvers
Create an n-by-n null matrix and fill with ones certain positions
268 Solvers
452 Solvers
275 Solvers
326 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!