 Assuming that each element is equally likely to be searched, each iteration makes 1.5 comparisons on average.A variation of the algorithm checks whether the middle element is equal to the target at the end of the search.On average, this eliminates half a comparison from each iteration.