Sorting Algorithms: Speed Is Found In The Minds of People - Andrei Alexandrescu - CppCon 2019

Caption notes

Andrei Alexandrescu starts with a choice in hybrid sorting: how small should a subarray get before quicksort switches to a different sort? In one insertion-sort experiment, he reports that using binary search cut comparisons but increased runtime, and offers branch predictability as an explanation. He then tries combining comparisons, moves, and the distance between successive accesses to see how well they explain the timings. In the Q&A, he says he chose the composite weight by hand to fit his measurements and tested only on Intel machines.