Asymptotic expansions for moments of number of comparisons used by the randomized quick sort algorithm
arXiv:1610.05656
Abstract
We calculate asymptotic expansions for the moments of number of comparisons used by the randomized quick sort algorithm using the singularity analysis of certain generating functions.