Corpus ID: 119123634

# A Detailed Analysis of Quicksort Running Time

@article{Ekhad2019ADA,
title={A Detailed Analysis of Quicksort Running Time},
author={S. B. Ekhad and D. Zeilberger},
journal={arXiv: Probability},
year={2019}
}
• Published 2019
• Mathematics
• arXiv: Probability
One of the greatest algorithms of all time is Quicksort. Its average running time is famously O(nlog(n)), and its variance, less famously, is O(n^2) (hence its standard deviation is O(n)). But what about higher moments? Here we find explicit expressions for the first eight moments, their scaled limits, and we describe how to compute, approximately (but very accurately), percentiles of running time for any list-length
A Detailed Analysis of Quicksort Algorithms with Experimental Mathematics
• Yukun Yao
• Mathematics, Computer Science
• ArXiv
• 2019
It is shown that with experimental mathematics, explicit expressions for expectations, variances and even higher moments of their numbers of comparisons and swaps can be obtained in single-pivot Quicksort algorithms. Expand
Using nonlinear difference equations to study Quicksort algorithms
Using nonlinear difference equations, combined with symbolic computations, we make a detailed study of the running times of numerous variants of the celebrated Quicksort algorithms, where we considerExpand
Logarithmic integrals, zeta values, and tiered binomial coefficients
• Mathematics
• 2019
We study logarithmic integrals of the form $\int_0^1 x^i\ln^n(x)\ln^m(1-x)dx$. They are expressed as a rational linear combination of certain rational numbers $(n,m)_i$, which we call tiered binomialExpand
An experimental mathematics approach to several combinatorial problems
Experimental mathematics is an experimental approach to mathematics in which programming and symbolic computation are used to investigate mathematical objects, identify properties and patterns,Expand
Recursive PGFs for BSTs and DSTs
• S. Finch
• Computer Science, Mathematics
• ArXiv
• 2020
We review fundamentals underlying binary search trees and digital search trees, with (atypical) emphasis on recursive formulas for associated probability generating functions. Other topics includeExpand