ObjectiveMcq
Print Protected
This page is protected for print. Use the website to view the content.
What is the worst case for linear search?
Correct Answer: C — O(n)
Worst case is when the desired element is at the tail of the array or not present at all, in this case you have to traverse till the end of the array, hence the complexity is O(n).