S
Savvoulidis Iordanis
OK, I cut the details off.
I have an array M x N (eg 4 x 2) with the following data:
1 X
X 2
1 2
X 2
How can I create (using recursion) all the possible vertical combinations
(16 in the example)?
Some of them are:
1 1 1 1
X X X X
1 1 2 2
X 2 X 2 and so on
TIA
I have an array M x N (eg 4 x 2) with the following data:
1 X
X 2
1 2
X 2
How can I create (using recursion) all the possible vertical combinations
(16 in the example)?
Some of them are:
1 1 1 1
X X X X
1 1 2 2
X 2 X 2 and so on
TIA