Cody

Solution 2069493

Submitted on 26 Dec 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
v = logical([0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0]); n = 1; i = consecutiveFind(v, n); i_correct = 2; assert(isequal(i, i_correct))

Assertion failed.

2   Fail
v = logical([0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0]); n = 4; i = consecutiveFind(v, n); i_correct = 6; assert(isequal(i, i_correct))

Index exceeds the number of array elements (11). Error in consecutiveFind (line 3) if all( v(i : i+n-1) ) == true && i+n<=1 Error in Test2 (line 3) i = consecutiveFind(v, n);

3   Fail
v = logical([0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0]); n = 6; i = consecutiveFind(v, n); assert(isempty(i))

Index exceeds the number of array elements (11). Error in consecutiveFind (line 3) if all( v(i : i+n-1) ) == true && i+n<=1 Error in Test3 (line 3) i = consecutiveFind(v, n);

4   Fail
v = false(1, 10); n = 1; i = consecutiveFind(v, n); assert(isempty(i))

Assertion failed.

5   Fail
x = 0 : pi/4 : 2*pi; v = sin(x) < 1; n = 5; i = consecutiveFind(v, n); i_correct = 4; assert(isequal(i, i_correct))

Index exceeds the number of array elements (9). Error in consecutiveFind (line 3) if all( v(i : i+n-1) ) == true && i+n<=1 Error in Test5 (line 4) i = consecutiveFind(v, n);