On the Competitiveness of Linear Search

Abstract

We reexamine ooine techniques for linear search. Under a reasonable model of computation, a method is given to perform ooine linear search in amortized cost proportional to the entropy of the request sequence. It follows that no online technique can have an amortized cost of that which one could obtain if given the request sequence in advance, i.e., there is no competitive linear search algorithm.

DOI: 10.1007/3-540-45253-2_31

Extracted Key Phrases

Cite this paper

@inproceedings{Munro2000OnTC, title={On the Competitiveness of Linear Search}, author={J. Ian Munro}, booktitle={ESA}, year={2000} }