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 =
1
|
2 | Pass |
x = [0];
assert(isequal(mono_increase(x),true));
tf =
1
|
3 | Pass |
x = [0 0 0 0 0];
assert(isequal(mono_increase(x),false));
tf =
0
|
4 | Pass |
x = [0 1 2 3 -4];
assert(isequal(mono_increase(x),false));
tf =
0
|
5 | Pass |
x = [-3 -4 2 3 4];
assert(isequal(mono_increase(x),false));
tf =
0
|
6 | Pass |
x = 1:.1:10;
assert(isequal(mono_increase(x),true));
tf =
1
|
7 | Pass |
x = cumsum(rand(1,100));
x(5) = -1;
assert(isequal(mono_increase(x),false));
tf =
0
|
8 | Pass |
x = cumsum(rand(1,50));
assert(isequal(mono_increase(x),true));
tf =
1
|
Find the sum of the elements in the "second" diagonal
994 Solvers
695 Solvers
260 Solvers
583 Solvers
326 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!