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

sorted() returns a sorted array rather than sorting in place. You're actually measuring the same array twice.