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 successful search, on average, the item being searched for will be found halfway through the list, so the number of key comparisons executed will be approximately 50 (i.e., half of the length of the list).

Suppose That L Is a List of Length 100