Asymptotic expansions for moments of number of comparisons used by the randomized quick sort algorithm
Data Structures and Algorithms
2017-03-21 v4
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.
Keywords
Cite
@article{arxiv.1610.05656,
title = {Asymptotic expansions for moments of number of comparisons used by the randomized quick sort algorithm},
author = {Sumit Kumar Jha},
journal= {arXiv preprint arXiv:1610.05656},
year = {2017}
}