This solution is outdated. To rescore this solution, sign in.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = [0 1 2 3 4];
assert(isequal(mono_increase(x),true));
tf =
logical
1
|
2 | Pass |
x = [0];
assert(isequal(mono_increase(x),true));
tf =
logical
1
|
3 | Pass |
x = [0 0 0 0 0];
assert(isequal(mono_increase(x),false));
tf =
logical
0
|
4 | Pass |
x = [0 1 2 3 -4];
assert(isequal(mono_increase(x),false));
tf =
logical
0
|
5 | Pass |
x = [-3 -4 2 3 4];
assert(isequal(mono_increase(x),false));
tf =
logical
0
|
6 | Pass |
x = 1:.1:10;
assert(isequal(mono_increase(x),true));
tf =
logical
1
|
7 | Pass |
x = cumsum(rand(1,100));
x(5) = -1;
assert(isequal(mono_increase(x),false));
tf =
logical
0
|
8 | Pass |
x = cumsum(rand(1,50));
assert(isequal(mono_increase(x),true));
tf =
logical
1
|
1600 Solvers
831 Solvers
Make a run-length companion vector
512 Solvers
Right Triangle Side Lengths (Inspired by Project Euler Problem 39)
511 Solvers
311 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!