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));
|
2 | Pass |
%%
x = [0];
assert(isequal(mono_increase(x),true));
|
3 | Pass |
%%
x = [0 0 0 0 0];
assert(isequal(mono_increase(x),false));
|
4 | Pass |
%%
x = [0 1 2 3 -4];
assert(isequal(mono_increase(x),false));
|
5 | Pass |
%%
x = [-3 -4 2 3 4];
assert(isequal(mono_increase(x),false));
|
6 | Pass |
%%
x = 1:.1:10;
assert(isequal(mono_increase(x),true));
|
7 | Pass |
%%
x = cumsum(rand(1,100));
x(5) = -1;
assert(isequal(mono_increase(x),false));
|
8 | Pass |
%%
x = cumsum(rand(1,50));
assert(isequal(mono_increase(x),true));
|
Sort a list of complex numbers based on far they are from the origin.
4327 Solvers
277 Solvers
Piecewise linear interpolation
298 Solvers
348 Solvers
519 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!