Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask

Re: Fast, Efficient Union and Intersection on arrays

by Roy Johnson (Monsignor)
on Nov 20, 2008 at 18:07 UTC ( #724942=note: print w/replies, xml ) Need Help??

in reply to Fast, Efficient Union and Intersection on arrays

I note two things: you only want the number of elements in the intersection and union, not the actual intersection and union; and your method suggests that there are no duplicates in the sets. So you don't need to find the union, explicitly. It is just the total number in I + J, minus the intersection.
sub get_int_uni2 { my ($in, $jn) = @_; my %i; @i{@$in} = (); my $int = grep exists $i{$_}, @$jn; return ($int, @$in + @$jn - $int); }
Sadly, I don't see any real improvement in performance (thanks to BrowserUK for the benchmarkery).

Caution: Contents may have been coded under pressure.

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (2)
As of 2023-04-02 02:37 GMT
Find Nodes?
    Voting Booth?

    No recent polls found