Can a randomized binary search have an \(O(1)\) complexity at least in practice?

DOI10.1016/J.AMC.2006.12.079zbMath1123.68027OpenAlexW1984706802MaRDI QIDQ2383711

Soubhik Chakraborty

Publication date: 19 September 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.12.079

zbMATH Keywords

empirical \(O(1)\) complexityrandomized binary search

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Randomized algorithms (68W20)

Related Items (1)

On why an algorithmic time complexity measure can be system invariant rather than system independent

This page was built for publication: Can a randomized binary search have an \(O(1)\) complexity at least in practice?