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