Analysis of the expected number of bit comparisons required by Quickselect

DOI10.1137/1.9781611972986.9MaRDI QIDQ6827911zbMATH OpenFDO

Authors James Allen Fill, Takehiko Nakama

Publication date 16 September 2019

Published in 2008 Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611972986.9

Mathematics Subject Classification ID

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

This page was built for publication: Analysis of the expected number of bit comparisons required by Quickselect

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