What is the worst-case scenario for a linear search in an array of 'n' elements?

Question

Choose the statements that are correct.
Options:
(A) For Binary Search, all the elements have to be sorted.
(B) For Linear Search, all the elements have to be sorted.
(C) Linear Search takes less time for searching in worst case than binary search’s worst case.
(D) Linear Search always gives fast result whether elements are sorted or not.
Choose the correct answer from the options given below:

Answer 1

Step 1: Understanding the Concept:
Linear search checks each element of the list sequentially until a match is found or the whole list has been searched.

Step 2: Detailed Explanation:
The worst-case scenario occurs when the algorithm has to inspect every single element in the array before finding the target or concluding that the target is not present. This happens when the target is the last element or not in the array at all.

Step 3: Final Answer:
The worst-case is when the target element is the last element.

What is the worst-case scenario for a linear search in an array of 'n' elements?

Show Hint

The Correct Option is A

Solution and Explanation

Top Questions on Searching

Questions Asked in CUET (UG) exam