Asymptotic analysis of an optimized quicksort algorithm.
Jon Bentley and Douglas McIlroy have implemented a fast quicksort for the C standard library in 1993. We consider here the average-case complexity in terms of number of comparisons of this algorithm, and give its asymptotic expansion up to the constant order.
scientific article; zbMATH DE number 1856511