Unbounded searching can be viewed as searching an ordered table of infinite size. In this paper we present an algorithm for unbounded searching and derive a lower bound on the number of comparisons required which shows that the algorithm is very nearly optimal. (Submitted to Information Processing Letters) * Work supported in part by U. S. Energy Research and Development Administration under co...

a Departamento de Inform atica, Escola Superior de Enxener ıa Inform atica, Universidad de Vigo, Campus Universitario As Lagoas, E-32004 Ourense, Spain b Departamento de Inform atica, Escuela Polit ecnica, Universidad de Extremadura, Avda de la Universidad, s/n, E-10004 C aceres, Spain c Departamento de Zootecnia, Facultad de Veterinaria, Universidad de Extremadura, Avda de la Universidad, s/n,...