Dynamic interpolation search in o(log log n) time
- Arne AnderssonAffiliated withDepartment of Computer Science, Lund University
- , Christer MattssonAffiliated withDepartment of Computer Science, Lund University
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 θ(log2 n) 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”?
- Dynamic interpolation search in o(log log n) time
- Book Title
- Automata, Languages and Programming
- Book Subtitle
- 20th International Colloquium, ICALP 93 Lund, Sweden, July 5–9, 1993 Proceedings
- pp 15-27
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Additional Links
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.