Consider the following list.list = {20, 10, 17, 2, 18, 35, 30, 90, 48, 47};Suppose that sequential search as discussed in the book is used to determine whether 95 is in list. Exactly how many key comparisons are executed by the sequential search algorithm?
A) 1
B) 8
C) 9
D) 10

Question

Quizplus · Accepted Answer

Sequential search algorithm iterates through the list comparing each element with the search key until it finds the match. In this case, the algorithm will iterate through the entire list and compare the search key (95) with each element in the list. Therefore, the total number of comparisons will be equal to the length of the list, which is 10. So, the correct answer is option C (9 comparisons have to be performed before the algorithm determines that 95 is not in the list).

Consider the Following List