Asymptotic expansions for factorial moments of some distributions in the analysis of algorithms
classification
💻 cs.DS
keywords
numberanalysisasymptoticdistributionsexpansionsfactorialmomentspermutation
read the original abstract
We establish asymptotic expansions for factorial moments of following distributions: number of cycles in a random permutation, number of inversions in a random permutation, and number of comparisons used by the randomized quick sort algorithm.To achieve this we use singularity analysis of certain type of generating functions due to Flajolet and Odlyzko.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.