Revisiting calculation of moments of number of comparisons used by the randomized quick sort algorithm

DOI10.1142/S179383091750001XzbMath1404.68037arXiv1609.01870OpenAlexW2527912992MaRDI QIDQ2966500

Sumit Kumar Jha

Publication date: 7 March 2017

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1609.01870

zbMATH Keywords

sortinganalysis of algorithmsquicksort

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Randomized algorithms (68W20)

Cites Work

• An asymptotic theory for Cauchy–Euler differential equations with applications to the analysis of algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Revisiting calculation of moments of number of comparisons used by the randomized quick sort algorithm