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

(a) O(n)

(b) O(2^n)

(c) O(1)

(d) O(log n)

I have been asked this question during a job interview.

My question is from Searching topic in chapter Searching of Data Structures & Algorithms II

1 Answer

+1 vote
by (614k points)
selected by
 
Best answer
The correct answer is (d) O(log n)

The best explanation: Exponential search requires an auxiliary space of log n when used with recursive binary search. This space is required for the recursion call stack space.

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

...