ObjectiveMcq
Print Protected
This page is protected for print. Use the website to view the content.
What is the time complexity of exponential sort?
Correct Answer: D — O(log n)
In exponential search, we first find a range where the required elements should be present in the array. Then we apply binary search in this range. This takes O(log n) time in the worst case.