Computer Science, asked by anonymous1767, 10 months ago

Why sequential search may be inefficient?

Answers

Answered by abirami200014
0

Explanation:

it is inefficient when the array being searched contains large number of elements. The algorithm will have to look through all the elements in order to find a value in the last element. The average probability of finding an item at the beginning of the array is almost the same as finding it at the end

Similar questions