Corpus ID: 119123634

A Detailed Analysis of Quicksort Running Time

  title={A Detailed Analysis of Quicksort Running Time},
  author={S. B. Ekhad and D. Zeilberger},
  journal={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
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


Quicksort Algorithm Again Revisited
An integral equation for the probability density of the number of comparisons L(n) is established and it is shown that the left tail of the limiting distribution is much ''thinner'' than the right tail (which is only exponential). Expand
A Note Concerning the Limit Distribution of the Quicksort Algorithm
  • M. Cramer
  • Mathematics, Computer Science
  • RAIRO Theor. Informatics Appl.
  • 1996
It turns out that the lognormal distribution is a very good approximation for the limit distribution of Quicksort algorithm, but by exact and numerical calculation of some moments it is demonstrated that these distributions are not the same. Expand
Concrete mathematics - a foundation for computer science
From the Publisher: This book introduces the mathematics that supports advanced computer programming and the analysis of algorithms. The primary aim of its well-known authors is to provide a solidExpand
The Art in Computer Programming
Here the authors haven’t even started the project yet, and already they’re forced to answer many questions: what will this thing be named, what directory will it be in, what type of module is it, how should it be compiled, and so on. Expand
The concrete tetrahedron
  • M. Kauers
  • Mathematics, Computer Science
  • ISSAC '11
  • 2011
We give an overview over computer algebra algorithms for dealing with symbolic sums, recurrence equations, generating functions, and asymptotic estimates, and we will illustrate how to apply theseExpand
Symbolic summation assists combinatorics.
We present symbolic summation tools in the context of difference fields that help scientists in practical problem solving. Throughout this article we present multi-sum examples which are related toExpand
The Art of Computer Programming, Volume III: Sorting and Searching
  • D. Knuth
  • Computer Science, Mathematics
  • 1973