On a side note, the mathematical construct you are describing is known as a "poset" =
partially ordered set
The best algorithm depends on your data's size, because a complex algorithm doesn't pay off when only being some seconds faster.
My take on it is to first sort and partition your words in subsets of same length, because every "cover word" must have more letters.
Start by putting all words of the first partition into @uncovered and test them against all words of the next partition.
For each match you'll store into a hash $cover{$smaller}=$bigger and delete $smaller from @uncovered.
Then you'll push the @current_partition to the remaining words in @uncovered and repeat with the next partition.
This is a generic algorithm, your case with 9 up and 8 down can be easily adopted.
Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
Read Where should I post X? if you're not absolutely sure you're posting in the right place.
Please read these before you post! —
Posts may use any of the Perl Monks Approved HTML tags:
- a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
| |
For: |
|
Use: |
| & | | & |
| < | | < |
| > | | > |
| [ | | [ |
| ] | | ] |
Link using PerlMonks shortcuts! What shortcuts can I use for linking?
See Writeup Formatting Tips and other pages linked from there for more info.