This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
lo = 1;
hi = 15;
y_correct = 1:15;
assert(isequal(subindeces(lo,hi),y_correct))
idx =
[]
idx =
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
i =
2
|
2 | Pass |
lo = [1 5 10];
hi = [3 8 15];
y_correct = [1 2 3 5 6 7 8 10 11 12 13 14 15];
assert(isequal(subindeces(lo,hi),y_correct))
idx =
[]
idx =
1 2 3
i =
2
idx =
1 2 3 5 6 7 8
i =
3
idx =
1 2 3 5 6 7 8 10 11 12 13 14 15
i =
4
|
3 | Pass |
lo = [3 5 6 7];
hi = [1 4 6 8];
y_correct = [6 7 8];
assert(isequal(subindeces(lo,hi),y_correct))
idx =
[]
idx =
1×0 empty double row vector
i =
2
idx =
1×0 empty double row vector
i =
3
idx =
6
i =
4
idx =
6 7 8
i =
5
|
4 | Pass |
lo = 1:5;
hi = [5 4 3 2 1];
y_correct = [1 2 3 4 5 2 3 4 3];
assert(isequal(subindeces(lo,hi),y_correct))
idx =
[]
idx =
1 2 3 4 5
i =
2
idx =
1 2 3 4 5 2 3 4
i =
3
idx =
1 2 3 4 5 2 3 4 3
i =
4
idx =
1 2 3 4 5 2 3 4 3
i =
5
idx =
1 2 3 4 5 2 3 4 3
i =
6
|
Return the 3n+1 sequence for n
6167 Solvers
Read a column of numbers and interpolate missing data
1235 Solvers
521 Solvers
2618 Solvers
393 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!