|P is for Practical|
does perl have branch predictionby david2008 (Scribe)
|on Jan 29, 2014 at 05:01 UTC||Need Help??|
david2008 has asked for the
wisdom of the Perl Monks concerning the following question:
I came over an interesting post in stackoverflow
It explains that in Java/C++ processing a sorted array is faster than an unsorted. Let's say you have an array @a, then.
If @a is sorted, will it be faster than unsorted?
Similary if i have a condition:
and fun_z fails consistently, will fun_z be calculated at the beginning?