Asymptotic analysis of an optimized quicksort algorithm.
type: Item
instance of: scholarly article
title: Asymptotic analysis of an optimized quicksort algorithm.
zbMATH Open document ID: 1042.68119
DOI: 10.1016/S0020-0190(02)00351-4
author: Marianne Durand
published in: Information Processing Letters
publication date: 2003-01-21T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 1856511
zbMATH Keywords: Quicksort
zbMATH Keywords: Euler equations
zbMATH Keywords: Analysis of algorithms
describes a project that uses: gfun
describes a project that uses: Quicksort
MaRDI profile type: Publication
cites work: Q3661894
cites work: Phase changes in random \(m\)-ary search trees and generalized quicksort
cites work: Singularity Analysis of Generating Functions
cites work: Q4320535
cites work: Quicksort
cites work: Linear probing and graphs
cites work: GFUN
cites work: Q3992743
cites work: Quicksort with Equal Keys
cites work: Q4855565
Recommended article: A note on the quicksort asymptotics
Recommended article: Quicksort asymptotics
Recommended article: Refined quicksort asymptotics
Recommended article: Combinatorial analysis of quicksort algorithm
Recommended article: Towards a realistic analysis of the QuickSelect algorithm
Recommended article: On Smoothed Analysis of Quicksort and Hoare’s Find
Recommended article: On smoothed analysis of quicksort and Hoare's find
Recommended article: A note concerning the limit distribution of the quicksort algorithm
description: scientific article; zbMATH DE number 1856511