For completeness.
Another approach would be combining a binary search with string equality eq if your priorities tend towards performance.
Of course you could change to a division factor other than 0.5 depending on heuristics.
Cheers Rolf
(addicted to the Perl Programming Language :)
Wikisyntax for the Monastery
In reply to Re^5: CPAN Module to determing overlap of 2 lists?
by LanX
in thread CPAN Module to determing overlap of 2 lists?
by wazat
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |