Asymptotic analysis of an optimized quicksort algorithm. (Q1853184): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: gfun / rank | |||
Normal rank | |||
Revision as of 02:58, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Asymptotic analysis of an optimized quicksort algorithm. |
scientific article |
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
