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

DOI10.2989/QM.2008.31.4.1.605zbMath1162.68458OpenAlexW2077586088MaRDI QIDQ3597921

Prodinger, Helmut, 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

quickselectresiduesEuler-MacLaurin formulabit comparisons

Mathematics Subject Classification ID

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

Related Items (2)

Towards a realistic analysis of the QuickSelect algorithm ⋮ Analysis of the expected number of bit comparisons required by quickselect

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