Dynamic interpolation search in o(log log n) time
- Cite this paper as:
- Andersson A., Mattsson C. (1993) Dynamic interpolation search in o(log log n) time. In: Lingas A., Karlsson R., Carlsson S. (eds) Automata, Languages and Programming. ICALP 1993. Lecture Notes in Computer Science, vol 700. Springer, Berlin, Heidelberg
a trade-off between input distribution and search cost for dynamic interpolation search.
θ(log log n) expected time for search and update operations for a larger class of densities than Mehlhorn and Tsakalidis.
o(log log n) expected time for search and update operations for a large class of densities. As an example, we give an unbounded density for which we achieve θ(log*n) expected time. We also show θ(1) expected time for all bounded densities, in particular, the uniform distribution.
improved worst-case cost from θ(log2n) to θ(log n) for searches and from θ(n) to θ(log n) for updates.
We also include a discussion of terminology: which methods should be termed “interpolation search”?
Unable to display preview. Download preview PDF.