Cody

# Problem 1229. Determine the number of odd integers in a vector

Solution 2066089

Submitted on 21 Dec 2019 by Alistair James
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   Pass
x = [2 5 8 3 7 1]; y_correct = 4; assert(isequal(NumOdd(x),y_correct))

lenx = 6 j = 26 k = 26 y = 0 y = 0 y = 0 y = 1 y = 1 y = 2 y = 3 y = 4

2   Pass
x = [2 5 0 3 7 0]; y_correct = 3; assert(isequal(NumOdd(x),y_correct))

lenx = 6 j = 17 k = 17 y = 0 y = 0 y = 0 y = 1 y = 1 y = 2 y = 3 y = 3

3   Pass
x = [2 5 -10 3 -7 0]; y_correct = 3; assert(isequal(NumOdd(x),y_correct))

lenx = 6 j = -7 k = -7 y = 0 y = 0 y = 0 y = 1 y = 1 y = 2 y = 3 y = 3

4   Pass
x = [2 4 -6 8 -4 0]; y_correct = 0; assert(isequal(NumOdd(x),y_correct))

lenx = 6 j = 4 k = 4 y = 0 y = 0 y = 0 y = 0 y = 0 y = 0 y = 0 y = 0

5   Pass
x = [2 5 -10 3 2 0]; y_correct = 2; assert(isequal(NumOdd(x),y_correct))

lenx = 6 j = 2 k = 2 y = 0 y = 0 y = 0 y = 1 y = 1 y = 2 y = 2 y = 2

6   Pass
x = []; y_correct = 0; assert(isequal(NumOdd(x),y_correct))

lenx = 0 j = 0 k = 0 y = 0 y = 0

7   Pass
x = [1.5]; y_correct = 0; assert(isequal(NumOdd(x),y_correct))

lenx = 1 j = 1.5000 k = 2 y = 0

8   Pass
x = [-11.9 3.7 5.01]; y_correct = 0; assert(isequal(NumOdd(x),y_correct))

lenx = 3 j = -3.1900 k = -3 y = 0