ObjectiveMcq
Print Protected
This page is protected for print. Use the website to view the content.
What is the best case and worst case complexity of ordered linear search?
Correct Answer: D — O(1), O(n)
Although ordered linear search is better than unordered when the element is not present in the array, the best and worst cases still remain the same, with the key element being found at first position or at last position.