I have five massive collections filled with various strings, and each of them contains a different number of elements.
Below are examples of the lists:
List 1
"Jeffrey the Great",
"Bean-man",
"Joe",
"Charles",
"Flamur",
"Leka",
"the defender of men",
List 2
"awesome",
"claustrophobic",
"sad",
"very masculine",
"stinky",
"outrageous",
"underage",
"endangered",
"filthy",
"kinda smooth",
"overly threatening",
List 3
"corpse",
"skeleton",
"average joe",
"mafia boss",
"murderer",
"butcher",
"dog",
"muslim",
"fish salesman",
List 4
"impregnate",
"punch",
"eat",
"kill",
"hunt down",
"outrun",
"touch",
List 5
"Steve",
"Stalin",
"el Chupacabra",
"everyone",
"a donut",
"a fish",
"the Americans",
"your neighbors",
I'm interested in discovering all the potential combinations of the five lists. For instance:
Jeffery the Great, awesome, corpse, impregnate, Steve
Bean-man, awesome, corpse, impregnate, Steve
Joe, awesome, corpse, impregnate, Steve
Charles, awesome, corpse, impregnate, Steve
Jeffery the Great, claustrophobic, corpse, impregnate, Steve
Bean-man, claustrophobic, corpse, impregnate, Steve
Joe, claustrophobic, corpse, impregnate, Steve
Charles, claustrophobic, corpse, impregnate, Steve
...and the list goes on for each item in every list.
Each combination must include one element from each array/list. I don't need to generate the combinations themselves, only the count of each potential combination! For example:
List 1
a
b
c
List 2
1
2
3
Result:
9 possible combinations
Any suggestions on how I could determine this?