Why processing a sorted array is faster than processing an unsorted array

This is a fascinating article that I think should be submitted every six months or so. If you haven't read it, I strongly recommend that you do so.

The only substantial discussion on HN I could find is from 4 years ago: https://news.ycombinator.com/item?id=4637196

It would be interesting to know if anything has changed.

In case you're interested in checking for other comments on the topic (and there are a few here and there), here are some of the other submissions:

To me, the profiling parable seems more important than the sorting story.

Why processing a sorted array is faster than processing an unsorted array (stackoverflow.com)