A: If the elements are completely unordered, and the search is done in a sequential manner, the total number of comparisons is 100. If we divide this by the number of elements in the array, we get an average of 100 comparisons. 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