ObjectiveMcq
Print Protected
This page is protected for print. Use the website to view the content.
Best case of the exponential search will have time complexity of?
Correct Answer: A — O(1)
Best case of the exponential search will be when the first element of the array is the element that is being searched. In this case, only one comparison will be required. Thus it will have a time complexity of O(1).