Cody

# Problem 10. Determine whether a vector is monotonically increasing

Solution 1849161

Submitted on 14 Jun 2019
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

### Test Suite

Test Status Code Input and Output
1   Fail
x = [0 1 2 3 4]; assert(isequal(mono_increase(x),true));

Index exceeds the number of array elements (1). Error in mono_increase (line 8) if x(i+2) - x(i+1) == x(i+1) - x(i) Error in Test1 (line 2) assert(isequal(mono_increase(x),true));

2   Fail
x = ; assert(isequal(mono_increase(x),true));

Index exceeds the number of array elements (1). Error in mono_increase (line 3) if x(i+1) <= x(i) Error in Test2 (line 2) assert(isequal(mono_increase(x),true));

3   Pass
x = [0 0 0 0 0]; assert(isequal(mono_increase(x),false));

tf = logical 0

4   Fail
x = [0 1 2 3 -4]; assert(isequal(mono_increase(x),false));

Index exceeds the number of array elements (1). Error in mono_increase (line 8) if x(i+2) - x(i+1) == x(i+1) - x(i) Error in Test4 (line 2) assert(isequal(mono_increase(x),false));

5   Pass
x = [-3 -4 2 3 4]; assert(isequal(mono_increase(x),false));

tf = logical 0

6   Fail
x = 1:.1:10; assert(isequal(mono_increase(x),true));

Index exceeds the number of array elements (1). Error in mono_increase (line 8) if x(i+2) - x(i+1) == x(i+1) - x(i) Error in Test6 (line 2) assert(isequal(mono_increase(x),true));

7   Fail
x = cumsum(rand(1,100)); x(5) = -1; assert(isequal(mono_increase(x),false));

Index exceeds the number of array elements (1). Error in mono_increase (line 8) if x(i+2) - x(i+1) == x(i+1) - x(i) Error in Test7 (line 3) assert(isequal(mono_increase(x),false));

8   Fail
x = cumsum(rand(1,50)); assert(isequal(mono_increase(x),true));

Index exceeds the number of array elements (1). Error in mono_increase (line 8) if x(i+2) - x(i+1) == x(i+1) - x(i) Error in Test8 (line 2) assert(isequal(mono_increase(x),true));