Vidyalelo
Data Structure · Q121

Searching Algorithms

Programming · Data Structure · question 121

Q121

What is the auxiliary space requirement of an exponential sort when used with iterative binary search?

A.
O(n)
B.
O(2n)
C.
O(1)
Answer
D.
O(log n)

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board