 When the target element is not in the array, binary search makes formula_112 iterations on average, assuming that the range between and outside elements is equally likely to be searched.In the best case, where the target value is the middle element of the array, its position is returned after one iteration.In terms of iterations, no search algorithm that works only by comparing elements can exhibit better average and worst-case performance than binary search.