bentley & mcilroy, “engineering a sort function” says that was an old trick in 1993!
“Although Quicksort is efficient for large arrays, its overhead can be severe for small arrays. Hence we use the old trick of sorting small subarrays by insertion sort.”