Combinatorial analysis of quicksort algorithm

DOI10.1051/ITA/1989230303171zbMath0685.68058OpenAlexW68608586MaRDI QIDQ4203824

Paul-Louis Hennequin

Publication date: 1989

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92337

zbMATH Keywords

sortingaverage computing timehigher moments of computingQUICKSORT

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Exact enumeration problems, generating functions (05A15)

Related Items (16)

Some properties of a limiting distribution in Quicksort ⋮ Logarithmic integrals, zeta values, and tiered binomial coefficients ⋮ Average-case analysis of multiple Quickselect: An algorithm for finding order statistics ⋮ Second phase changes in random \(m\)-ary search trees and generalized quicksort: Convergence rates ⋮ Analysis of quickselect : an algorithm for order statistics ⋮ Automatic average-case analysis of algorithms ⋮ General combinatorial schemas: Gaussian limit distributions and exponential tails ⋮ A limiting distribution for quicksort ⋮ Phase changes in randomm-ary search trees and generalized quicksort ⋮ On a multivariate contraction method for random recursive structures with applications to Quicksort ⋮ A limit theorem for “quicksort” ⋮ Using nonlinear difference equations to study Quicksort algorithms ⋮ QuickXsort: a fast sorting scheme in theory and practice ⋮ A note concerning the limit distribution of the quicksort algorithm ⋮ Unnamed Item ⋮ Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm

Uses Software

• Quicksort

Cites Work

• A limiting distribution for quicksort
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Combinatorial analysis of quicksort algorithm