A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. 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:Ο(log (log n))
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: