Asymptotic analysis of an optimized quicksort algorithm.

DOI10.1016/S0020-0190(02)00351-4zbMath1042.68119MaRDI QIDQ1853184

Marianne Durand

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

Euler equationsQuicksortAnalysis of algorithms

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (2)

Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme ⋮ Using nonlinear difference equations to study Quicksort algorithms

Uses Software

• gfun
• Quicksort

Cites Work

• Linear probing and graphs
• Phase changes in randomm-ary search trees and generalized quicksort
• Singularity Analysis of Generating Functions
• Quicksort with Equal Keys
• GFUN
• Quicksort
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Asymptotic analysis of an optimized quicksort algorithm.