Cody

# Problem 660. Find a subset that divides the vector into equal halves

Solution 2004482

Submitted on 6 Nov 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   Pass
x = [1 2 3 4 5 6 7]; xi = split_it(x); assert(isequal(sum(x(xi)),sum(x)/2));

l = 14 n = [] n = 6 3 4 1

2   Pass
x = [2 2 2 2 2 2]; xi = split_it(x); assert(isequal(sum(x(xi)),sum(x)/2));

l = 6 n = [] n = 1 1 1

3   Fail
x = [2 5 4 5 4]; xi = split_it(x); assert(isequal(sum(x(xi)),sum(x)/2));

l = 10 n = [] n = 2 2

Assertion failed.

4   Fail
x = [1 3 1 1 9 7]; xi = split_it(x); assert(isequal(sum(x(xi)),sum(x)/2));

l = 11 n = [] n = 1 6 2

Index exceeds the number of array elements (6). Error in Test4 (line 3) assert(isequal(sum(x(xi)),sum(x)/2));

5   Fail
x = primes(100); xi = split_it(x); assert(isequal(sum(x(xi)),sum(x)/2));

l = 530 n = [] n = 12 8 15 11 14 16 25 1 9 10 18 6 19 5 2

Index exceeds the number of array elements (25). Error in Test5 (line 3) assert(isequal(sum(x(xi)),sum(x)/2));