Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
PerlMonks  

Re: Finding largest common subset in lists?

by Enlil (Parson)
on Jun 06, 2003 at 20:21 UTC ( [id://263845]=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    use strict;
    use warnings;
    ...
    print Dumper LCCOS(\@array1,\@array1);
    print Dumper LCCOS(\@array2,\@array4);
    print Dumper LCCOS(\@array5,\@array6);
    
  2. or download this
    ####################################
    sub LCCOS {
    ...
      }
      return $current_largest;
    }   ##LCCOS
    

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others perusing the Monastery: (3)
As of 2024-04-19 17:29 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found