A variation on the basic binary algorithm involves not centering the algorithm around the lower and upper limits. Instead, two alternate parameters are maintained, one that points to the middle of the array segment still to be searched, and a second marking the half width of that segment. A binary search algorithm that uses this approach is referred to as a uniform binary search. Design and implement a uniform binary search.