If an element is present in an array of length n, how many element visits, in the worst case, are necessary to find it using a linear search? A) n / 2 B) n C) 2n D) n²

Question

Quizplus · Accepted Answer

In a linear search, each element is checked one by one from the start to the end of the array. In the worst case, the element is found at the last position or not present at all, requiring n visits.

If an Element Is Present in an Array of Length