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 =
0
tf =
1
|
2 | Pass |
%%
x = [0];
assert(isequal(mono_increase(x),true));
tf =
0
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 =
0
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 =
0
tf =
1
|
Make the vector [1 2 3 4 5 6 7 8 9 10]
35561 Solvers
1092 Solvers
Sum all integers from 1 to 2^n
8417 Solvers
Basics: 'Find the eigenvalues of given matrix
323 Solvers
Determine the number of odd integers in a vector
435 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!