Asymptotic analysis of an optimized quicksort algorithm

✍ Scribed by Marianne Durand

• Publisher: Elsevier Science
• Year: 2003
• Tongue: English
• Weight: 86 KB
• Volume: 85
• Category: Article
• ISSN: 0020-0190
• DOI: 10.1016/s0020-0190(02)00351-4

✦ Synopsis

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.