Asymptotic analysis of an optimized quicksort algorithm. (Q1853184)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Asymptotic analysis of an optimized quicksort algorithm. |
scientific article; zbMATH DE number 1856511
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Asymptotic analysis of an optimized quicksort algorithm. |
scientific article; zbMATH DE number 1856511 |
Statements
Asymptotic analysis of an optimized quicksort algorithm. (English)
0 references
21 January 2003
0 references
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.
0 references
Quicksort
0 references
Euler equations
0 references
Analysis of algorithms
0 references
0 references
0 references
0.88218045
0 references
0.8765362
0 references
0.8748322
0 references
0.8748322
0 references
