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

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

davorg

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?

A.A.

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?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (12)
As of 2014-04-25 08:41 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    April first is:







    Results (585 votes), past polls