Asymptotic analysis of an optimized quicksort algorithm. (Q1853184): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / describes a project that uses | |||
Property / describes a project that uses: gfun / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Quicksort / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3661894 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Phase changes in randomm-ary search trees and generalized quicksort / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Singularity Analysis of Generating Functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4320535 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Quicksort / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear probing and graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: GFUN / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3992743 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Quicksort with Equal Keys / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4855565 / rank | |||
Normal rank |
Latest revision as of 11:23, 5 June 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