快速排序的Linux实现是否“后退”到插入排序?

I was reading in Bentley & McIlroy (1993) that their suggested implementation of Quicksort uses Insertion Sort when the arrays get small enough.I was reading in Bentley & McIlroy (1993) that