What is the average number of comparisons needed in a
sequential search to determine the position of an element in
an array of 100 elements, if the elements are ordered from
largest to smallest?
Answer
I think it we can apply binary search which requires only logn comparison becoz elements are ordered (largest to smallest).