String Combination Algorithims

[EpicOfChaos]

Hey guys,
Anyone have any code, or psuedo code that would make the following scenerieo?
Strings A, B, C

Create as many combinations of the 3 strings
so long as the length of the entire new string is less than MAXLENGTH.
Example:

String A="a" B = "ab" C="ba";
combinations
a
aa
aaa
ab
aba
abba
. . .
Any ideas guys?

[aboolamoola]

i c ur problem, well i think the best way to solve ur problem is to make some loops, like a nested loop.

for (int i = 0; i < letter.length; i ++){
for (int j = 0; j < letter2.length; j ++){
.......
.......
}
}

[BigDaddyLH]

i c ur problem,

Please spell out words: "I see your..."

[RedSon]

Please spell out words: "I see your..."

aboolamoola,

In case you didn't notice, that is a warning from a moderator. Lets learn the rules of posting in this forum before we go and get ourselves another warning, mkay?

Click on this link: http://www.thescripts.com/forum/faq....ing_guidelines

P.S. [CODE=java]if (numWarning > x)
{
switch (userID)
{
case aboolamoola:
account += ban;
break;
}
}
[/CODE]

-MODERATOR

[EpicOfChaos]

I think I know what you are saying, but still not really understanding, I know that the number of combinations is 59.