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?
Options: A) 25 B) 50 C) 75 D) 100 E) 125
let us assume k be the element we need to search   then let array be n1,n2,n3..............n100   now to prove that the element searched is not there in the array we have to compare the element K with every element in the array.   So,totally we need 100 comparisons.   ANSWER:100
<result>D</result>
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?