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