Re^3: search array for closest lower and higher number from another array

Hm. On my Win64 system the difference between Perl and grep is much smaller.

[15:00:05.53] c:\test>perl -nle"/234/ && ++$c }{ print $c" 1GB.dat
6791

[15:00:17.31] 
##     11.78 seconds

[15:01:05.67] c:\test>grep -c -F 234 1GB.dat
6791

[15:01:14.28] c:\test>
##      8.61 seconds
[download]

I don't see much wrong with your benchmark, so I wonder if that means your Perl is much slower than mine or my grep slower than yours?

Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.

"Science is about questioning the status quo. Questioning authority".

In the absence of evidence, opinion is indistinguishable from prejudice.

Comment on Re^3: search array for closest lower and higher number from another array Download Code