On a Constant Arising in the Analysis of Bit Comparisons in Quickselect

DOI10.2989/QM.2008.31.4.1.605MaRDI QIDQ3597921zbMATH OpenOpenAlexFDO

Authors Helmut Prodinger, Peter J. Grabner

Publication date 29 January 2009

Published in Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2989/qm.2008.31.4.1.605

zbMATH Keywords

bit comparisonsEuler-MacLaurin formulaquickselectresidues

Mathematics Subject Classification ID

Asymptotic enumeration (05A16) Euler-Maclaurin formula in numerical analysis (65B15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The number of bit comparisons used by Quicksort, an average-case analysis
• The number of bit comparisons used by quicksort: an average-case analysis
• Analysis of quickselect : an algorithm for order statistics

Cited in

(4)

• Towards a realistic analysis of the QuickSelect algorithm
• scientific article; zbMATH DE number 4170913 (Why is no real title available?)
• The number of bit comparisons used by quicksort: an average-case analysis
• scientific article; zbMATH DE number 1962050 (Why is no real title available?)

This page was built for publication: On a Constant Arising in the Analysis of Bit Comparisons in Quickselect

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3597921)