+1 vote
in Data Structures & Algorithms II by (110k points)
What is the auxiliary space requirement of an exponential sort when used with iterative binary search?

(a) O(n)

(b) O(2^n)

(c) O(1)

(d) O(log n)

The question was asked in an online quiz.

Enquiry is from Searching in portion Searching of Data Structures & Algorithms II

1 Answer

+1 vote
by (614k points)
selected by
Best answer
Right choice is (c) O(1)

Best explanation: Exponential search does not require any auxiliary space for finding the element being searched. So it has a constant auxiliary space O(1).

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.