|
|
|
| go ahead... be a heretic | |
| PerlMonks |
Re: fastest way to compare two arraysby pajout (Curate) |
| on Apr 14, 2011 at 08:09 UTC ( [id://899377]=note: print w/replies, xml ) | Need Help?? |
|
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.
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||||||||||