|
|
|
| No such thing as a small change | |
| PerlMonks |
Re: Matching bits of 2 stringsby Zaxo (Archbishop) |
| on Jan 22, 2002 at 07:04 UTC ( [id://140577]=note: print w/replies, xml ) | Need Help?? |
|
If you sort a list of the strings into an array, the deepest matches will be neighbors. That allows you to terminate the search after relatively few applications of japhy's excellent advice. After Compline,
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||