Asymptotic expansions for moments of number of comparisons used by the randomized quick sort algorithm
Sumit Kumar Jha
TL;DR
This paper derives asymptotic expansions for the moments of the number of comparisons in randomized quicksort, using singularity analysis of generating functions to deepen understanding of its performance.
Contribution
It introduces a novel application of singularity analysis to obtain detailed asymptotic moments for quicksort's comparison count.
Findings
Asymptotic formulas for moments of comparisons
Enhanced understanding of quicksort's performance
Methodology applicable to similar algorithms
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBayesian Methods and Mixture Models · Face and Expression Recognition · Algorithms and Data Compression