Why is processing a sorted array not faster than an unsorted array in Python?

Question

In this post Why is processing a sorted array faster than random array, it says that branch predicton is the reason of the performance boost in sorted arrays.

But I just

Answer 1

Two reasons:

• Your array size is much too small to show the effect.
• Python has more overhead than C so the effect will be less noticeable overall.