Asymptotic analysis of an optimized quicksort algorithm

Authors:
Marianne Durand
Affiliations:
Algorithms Project, INRIA Rocquencourt, 78153 Le Chesnay, France
Venue:
Information Processing Letters
Year:
2003

Citing 7
Cited 3

Algorithms (2nd ed.)

Algorithms (2nd ed.)
Engineering a sort function

Software—Practice & Experience
GFUN: a Maple package for the manipulation of generating and holonomic functions in one variable

ACM Transactions on Mathematical Software (TOMS)
An introduction to the analysis of algorithms

An introduction to the analysis of algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Concrete Mathematics: A Foundation for Computer Science

Concrete Mathematics: A Foundation for Computer Science
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,

Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,

Acceleration of sweep-line technique by employing smart quicksort

Information Sciences—Informatics and Computer Science: An International Journal
Sorting and order statistics

Algorithms and theory of computation handbook
Increasing the efficiency of quicksort using a neural network based algorithm selection model

Information Sciences: an International Journal

Quantified Score

Hi-index	0.89

Visualization

Abstract

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.