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 2 is in list. Exactly how many key comparisons are executed by the sequential search algorithm?
A) 3
B) 4
C) 5
D) 8

Question

Quizplus · Accepted Answer

In sequential search, the algorithm checks each element in the list one by one until the key is found or the end of the list is reached.

In the given list, the algorithm will check the first element (20) and compare it with the search key (2). Since 20 is not equal to 2, the algorithm moves on to the next element (10) and compares it with the search key. Again, the key is not found, and the algorithm continues with the third element (17). At this point, the key is not found yet, so the algorithm proceeds to the fourth element (2). Finally, the key is found at the fourth element and the algorithm stops.

Therefore, a total of 4 key comparisons are executed by the sequential search algorithm to determine whether 2 is in the list.

Consider the Following List