Optimal K-pivot QuickSort admits explicit asymptotic expansions for comparison count expectation and variance, a Gaussian limit law for all K, and convergence rate bounds for K≤4.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Probabilistic analysis of optimal multi-pivot QuickSort
Optimal K-pivot QuickSort admits explicit asymptotic expansions for comparison count expectation and variance, a Gaussian limit law for all K, and convergence rate bounds for K≤4.