OpenEuphoria

my brain block

• Posted by Kat <gertie at PELL.NET> Aug 09, 2000
• 486 views

Hey all, i can't seem to get by this one, and it's an old problem with the new
Eu
sequence twist.....

Given:
seqA = {"one","","three","","","six"}
seqB = {"1","2","","","5",""}
seqC = {"uno","dos","tres","","cinco",""}

How do i make a list of all the possible combinations, using recursion? It hasto
use
recursion, because i don't know the length of seqA or seqB or seqC. All the seqX
should be the same length, but with different contents,, and i don't know how
many
seqX there are,, could be 1 or could be 10 or could be 50. Matching against a
blank
subseq is not needed or good.

Results for 3 seqX needed:
"one","1","uno"
"one","1","dos"
"one","1","tres"
"one","1","cinco"
"three","1","uno"
"three","1","dos"
"three","1","tres"
"three","1","cinco"

etc,, all possible pairings, regardless of if they are the correct translation.

Kat,
befuddled,
and wondering now who Fud was....