Suppose that L is a list of length 100. In a successful search, to determine whether an item is in L, on average the number of key comparisons executed by the sequential search algorithm, as discussed in this book, is ____.
A) 49
B) 50
C) 51
D) 100

Question

Quizplus · Accepted Answer

In a sequential search, on average, you will check half of the elements before finding the target, so for a list of 100 elements, it would be 50 comparisons.

Suppose That L Is a List of Length 100