Find all subset index of an array whose sums equal or nearest to a given target

• target = 700
• array = [200 250 340 100 500 360]

reference

[Walter Roberson]

To confirm, one of the outputs would be 200, 200, 200, 100? Because subset implies sets, and every value in a set is there an indefinite number of times -- set {200, 100} is the same as set {200, 200, 200, 100} so from any set you can "withdraw" any element multiple times.

Likewise, if we find any duplicates in the array, they should be treated the same as if they had only appeared once, correct?

[Stalin Samuel]

yes sir.but i need the elements without Repetition

[Walter Roberson]

So 200,200,200,100 would be accepted as long as no other permutation of those values was emitted?

Answer 1

[Andrei Bobrov]

a = dec2bin((0:bin2dec(sprintf('%d',ones(1,numel(array)))))')-'0';
k = bsxfun(@times,a,array);
d = abs(sum(k,2) - 700);
out = k(d == min(d),:);