Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid

Re: Efficient Comparison of Array elements

by davorg (Chancellor)
on Jan 08, 2003 at 15:54 UTC ( [id://225280]=note: print w/replies, xml ) Need Help??

in reply to Efficient Comparison of Array elements

You want the intersection and the difference of two sets.

This is in the FAQ.

How do I compute the difference of two arrays? How do I compute the intersection of two arrays?.

By the way, your syntax for creating your arrays:

my @one = [1,2,3,4]; my @two = [2,4,6,8];

is wrong. It should be either:

my @one = (1,2,3,4); my @two = (2,4,6,8);


my $one = [1,2,3,4]; my $two = [2,4,6,8];

"The first rule of Perl club is you do not talk about Perl club."
-- Chip Salzenberg

Replies are listed 'Best First'.
Re: Re: Efficient Comparison of Array elements
by aging acolyte (Pilgrim) on Jan 08, 2003 at 16:29 UTC

    Thanks a lot, that is roughly what I want. But a couple of follow ups:

    Is this efficient/practical if both arrays get to sizes of 10K elements?

    The array generated for difference contains elements from both arrays. I wanted those unique to @one AND those unique to @two. Again I can do this by comparing @difference with @one and @difference with @two. But I am running the same code three times. Is it practical?


    BTW - as for the syntax thing - a good general rule for SOPW would be "first engage brain then type...."

Log In?

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

How do I use this?Last hourOther CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (7)
As of 2024-04-23 15:05 GMT
Find Nodes?
    Voting Booth?

    No recent polls found