If the data collection is in sorted form and equally distributed then the run time complexity of interpolation search is ............
A. Ο(n)
B. Ο(1)
C. Ο(log n)
D. Ο(log (log n))
Answer:D
If the data collection is in sorted form and equally distributed then the run time complexity of interpolation search is ............
A. Ο(n) B. Ο(1) C. Ο(log n) D. Ο(log (log n))