Asymptotic expansions for moments of number of comparisons used by the randomized quick sort algorithm
Lists
Only you see this
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.
BibTeX
@misc{jha2016asymptotic,
author = {Sumit Kumar Jha},
title = {{Asymptotic expansions for moments of number of comparisons used by the randomized quick sort algorithm}},
year = {2016},
eprint = {1610.05656},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/1610.05656},
}