|The stupid question is the question not asked|
Re^3: Finding Combinations of Pairsby andye (Curate)
|on Jan 14, 2009 at 23:14 UTC||Need Help??|
BTW - and being serious now - you don't actually need to combine them into a single value.
If you do something like:
in the centre of the loops, then you end up with a useful tree-like structure, which gives you a quick index of, for each word, how many times each other word appears in combination with it.
Try it and use Data::Dumper to print the output, and you'll see what I mean.
Although I appreciate that may not be what the homework called for. <grin>
Best wishes, andy.