Searching Algorithms Questions
The time complexity of exponential search is O(log n), where n is the size of the input array.