Consider the following list. int[] intList = {35, 12, 27, 18, 45, 16, 38}; What is the minimum number of comparisons that have to be made to find 18 using a sequential search on intList?
A)1
B)2
C)3
D)4

Question

Quizplus · Accepted Answer

In a sequential search, the algorithm checks each element in the list one by one from the beginning until it finds the target value. To find 18, it would compare 35, then 12, then 27, and finally 18, making a total of 4 comparisons.

Consider the Following List