Which is the worst case for a linear search algorithm?
a) The element to be searched is present at the first position in the array
b) The element to be searched is present at the last position in the array
c) The element to be searched is present at the middle position in the array
d) The element to be searched is not present in the array
Answers
Answered by
3
Answer:
b is the answer
Explanation:
hope it will help you
Similar questions