 In interpolation-sequential search, interpolation is used to find an item near the one being searched for, then linear search is used to find the exact item.Using big-O notation, the performance of the interpolation algorithm on a data set of size "n" is "O"("n"); however under the assumption of a uniform distribution of the data on the linear scale used for interpolation, the performance can be shown to be "O"(log log "n").However, Dynamic Interpolation Search is possible in "o"(log log "n") time using a novel data structure.