Beefy Boxes and Bandwidth Generously Provided by pair Networks
more useful options
 
PerlMonks  

Re: fastest way to compare two arrays

by pajout (Curate)
on Apr 14, 2011 at 08:09 UTC ( #899377=note: print w/replies, xml ) Need Help??


in reply to fastest way to compare two arrays

divide et impera
1. @range is not necessary - there is just information of minimum and maximum.
2. If your @ports are sorted, imagine for a while that 100th item is wanted result. It means that 99th item has value 50098 and 100th item is greater than 50099. Check the half index of your range. If it is greater than expected value, seek left side, else seek right side. Seeking left xor right side, it is same problem, but amount of items is half.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://899377]
help
Chatterbox?
[Corion]: Hmm. My overkill logging of transactions seems to bear fruit. I've built it in a way that the decision on every transaction must be logged, even if the transaction is just skipped, to prevent silent skips.

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (4)
As of 2017-08-21 07:40 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Who is your favorite scientist and why?



























    Results (318 votes). Check out past polls.

    Notices?