generate all combination

Question

Given buckets of unique numbers, how do we generate all combinations where you choosing a number from each bucket only once.

For example, if given {1,12,3} and {4,22,6} the answer is:
1/4 12/22 3/6
1/4 12/6 3/22
1/22 12/4 3/6
1/22 12/6 3/4
1/6 12/4 3/22
1/6 12/22 3/4

Of course, we don't just want 2 buckets, but n buckets. And each bucket can contain any amount of numbers; the numbers are unique across buckets.

Any algorithm in c# would be appreciated. I would expect the result to be something like: List<List<int[]>>

Thanks!

Please post the code you have written so far. People generally do not like to just write your code for you. As it is, this is a work description, not a question. — Mitch Wheat, Feb 27 '11 at 06:03
Have you tried anything so far? If you have tried something and still not getting, then give us info on what you have tried so that we can guide you further to get it done. — JPReddy, Feb 27 '11 at 06:10
possible duplicate of [Generating all Possible Combinations](http://stackoverflow.com/questions/3093622/generating-all-possible-combinations) — Gabe, Feb 27 '11 at 06:48
All the 'generating all possible combination' posts I have seen end up generating a cartesian product. This is not quite that problem. — DuckoDeath, Feb 27 '11 at 16:53

score 0 · Answer 1 · edited May 23 '17 at 10:24

0

Take a look at this:

And this:

edited May 23 '17 at 10:24

Community

answered Feb 27 '11 at 06:58

Yochai Timmer

1 Answers1