Beefy Boxes and Bandwidth Generously Provided by pair Networks
Think about Loose Coupling
 
PerlMonks  

Re: Re: Finding largest common subset in lists?

by anjiro (Beadle)
on Jun 05, 2003 at 07:32 UTC ( #263244=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    use Algorithm::Diff qw(LCS);
    @seq1 = qw(a b c d f g h j q z);
    @seq2 = qw(a b c d e f g i j k r x y z);
    @lcs = LCS(\@seq1, \@seq2);
    

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://263244]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (3)
As of 2023-02-06 03:10 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    I prefer not to run the latest version of Perl because:







    Results (33 votes). Check out past polls.

    Notices?