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
|
Project Euler: Problem 8, Find largest product in a large string of numbers
315 Solvers
253 Solvers
Create a square matrix of multiples
383 Solvers
Magic is simple (for beginners)
2749 Solvers
1221 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!