+1 vote
in Data Structures & Algorithms II by (110k points)
Choose the incorrect statement about exponential search from the following.

(a) Exponential search is an in place algorithm

(b) Exponential search has a greater time complexity than binary search

(c) Exponential search performs better than binary search when the element being searched is present near the starting point of the array

(d) Jump search has a greater time complexity than an exponential search

The question was posed to me in an interview for job.

Asked question is from Searching in portion Searching of Data Structures & Algorithms II

1 Answer

+1 vote
by (614k points)
selected by
 
Best answer
Right option is (b) Exponential search has a greater time complexity than binary search

Easiest explanation - Time complexity of exponential search and binary search are the same. But exponential search performs better than binary search when the element being searched is present near the starting point of the array.

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.

Categories

...