Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much

Re: Re: Efficient Comparison of Array elements

by aging acolyte (Pilgrim)
on Jan 08, 2003 at 16:29 UTC ( #225290=note: print w/ replies, xml ) Need Help??

in reply to Re: Efficient Comparison of Array elements
in thread Efficient Comparison of Array elements


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...."

Comment on Re: Re: Efficient Comparison of Array elements

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others studying the Monastery: (10)
As of 2015-03-05 19:38 GMT
Find Nodes?
    Voting Booth?

    When putting a smiley right before a closing parenthesis, do you:

    Results (150 votes), past polls