Can I read Analyzing Interpolation Search Complexity on EtoBox?

Analyzing Interpolation Search Complexity by Amar datta is a document available to read on EtoBox.

What is Analyzing Interpolation Search Complexity about?

This document discusses binary interpolation search, a modification of conventional interpolation search. It begins by reviewing binary search and interpolation search, noting that interpolation search has an average complexity of O(log log n) compared to O(log n) for binary search. It then proposes that the O(log log n) behavior of interpolation search can be understood as a quadratic application of binary search. Specifically, it suggests applying binary search to progressively smaller subtrees at each le

Author

Amar datta

Language

EN