A: The average number of comparisons needed in a sequential search to determine that the element is not there, if the elements are completely unordered, is the average of the number of comparisons needed in the first 100 elements divided by the number of elements in the array. If the elements are completely unordered, the average number of comparisons needed to determine that the element is not there is 100. 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