B
billygotmail
Hey,
Does anyone have any idea how I could find all possible n-combinations
of an array {1,2,3,4,5,6,7,8,9} (where 1≤n≤9), add up these
combinations and output them in an array?
I realise this array would be pretty big, and I'm not sure if the
average PC would be able to handle it. What do you think? I've tried
Googling for examples, to no avail.
Thanks.
Does anyone have any idea how I could find all possible n-combinations
of an array {1,2,3,4,5,6,7,8,9} (where 1≤n≤9), add up these
combinations and output them in an array?
I realise this array would be pretty big, and I'm not sure if the
average PC would be able to handle it. What do you think? I've tried
Googling for examples, to no avail.
Thanks.