132 reputation
4
bio website
location
age
visits member for 2 years
seen Apr 20 at 11:06

Oct
22
comment Put N items into M groups such that the sums of the N's in every M are as even as possible
Thank you very much for this insight.
Oct
19
comment Put N items into M groups such that the sums of the N's in every M are as even as possible
@ThomasAndrews as evenly as possible was the best way I could think of, each M can't always be equal, so I'm trying to find the solution that has the least difference between sets of M
Oct
19
comment Put N items into M groups such that the sums of the N's in every M are as even as possible
@ThomasAndrews apologies for any ambiguity. S = {6, 3, 5, 2, 7, 11, 2} refers an array holding 7 sub arrays, of which the count of the first array is 6, 3 the second. So by saying the sum of all N's in each group, I mean the total of a sub-collection of S, e.g. S[0] + S[1] = 9. Im just trying to split them into M even columns if that makes sense.
Oct
19
comment Name of a set that allows repetition
Thank you for your help.
Sep
20
comment Divide N items into M groups with as near equal size as possible
Thanks, was thinking along the lines of this. Think I was going for something like set all to n/m, then a for loop, 1 to (n Mod m) adding one.
Sep
20
comment Divide N items into M groups with as near equal size as possible
Ah yes, its flooding back to me now. cheers