 In this case, the middle element of the left subarray () is and the middle element of the right subarray () is .Uniform binary search would store the value of as both indices differ from by this same amount.To reduce the search space, the algorithm either adds or subtracts this change from the index of the middle element.