+1 vote
in Data Structures & Algorithms II by (110k points)
Interpolation search has a better time complexity than exponential search for any given array.

(a) True

(b) False

I had been asked this question at a job interview.

I'm obligated to ask this question of Searching in division Searching of Data Structures & Algorithms II

1 Answer

+1 vote
by (614k points)
selected by
Best answer
The correct choice is (b) False

For explanation: The worst case time complexity of interpolation search and exponential search are O(n) and O(log n) respectively. So exponential search is better when the worst case scenario is considered.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.