Search:

Looks like a recursive method could do that. Pass it the array of arrays and have it extract one from each sub array and build the output string.

Don't see where the talk of combinations comes from. Here is an example of what I thought combinations could be: Given the letters: A,B,C you would get: ABC, ACB, BAC, BCA, CAB, CBA

Can you give...

I don't know how to solve the problem then if all the values are unknown.
All arrays in java are defined with a fixed size. They need not be full, but some how you can determine how many elements...

With a N*M array are there N*M different elements and (N*M)! different combinations?