A: The average number of comparisons needed in a sequential search is the sum of the two smallest numbers that divide the total number of comparisons. Since there are 100 elements in the array, the sum of the smallest numbers is 100 - 1 = 99. The answer is (D).
Answer the following multiple choice question with options (a), (b), (c), (d), (e) by reasoning step-by-step.
Q:The element being searched for is not found in an array of 100 elements. What is the average number of comparisons needed in a sequential search to determine that the element is not there, if the elements are completely unordered? Answer Choices: A)25 B)50 C)75 D)100 E)125