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.