二分查找的应用

二分查找是一种很有效率的查找方式，每次查找后余下的区间是指数级递减的。

二分查找的限制也很明显，就是数据必须是拍过序的。

首先我们来看通过二分查找的方式来计算一个数的平方根

def mySqrt(n: int, left: int, right: int, bit_num: float):
    mid = left + (right - left)/2
    if abs(n - mid * mid) <= math.pow(0.1, bit_num):
        return mid

    if n - mid * mid > 0:
        return mySqrt(n, mid, right, bit_num)
    else:
        return mySqrt(n, left, mid, bit_num)

可以看出来代码非常少，也很容易理解，每次都取中值的平方，判断中值的平方与n的差值，如果比n大，就在left到中值的区域，否则就在另外一边。

下面看二分查找的一些变形：

# 4 5 6 1 2 3
# 5 6 1 2 3 4
# 3 4 5 6 1 2
#查找循环有序数组的分割点
def find_pos(serachArr: [], left: int, right: int):
    if serachArr[left] < serachArr[right]:
        return left

    mid = left + (right-left)/2
    if serachArr[mid] > serachArr[left]:
        return find_pos(serachArr, mid + 1, right)
    else:
        return find_pos(serachArr, left, mid - 1)

#二分查找第一个相等的索引
def binary_find_first_same(searchArr: [], left: int,right: int, value: int):
    if left > right:
        return -1
    mid = left + (right-left)//2
    if searchArr[mid] > value:
        return binary_find_first_same(searchArr, left, mid -1, value)
    elif searchArr[mid] < value:
        return binary_find_first_same(searchArr, mid+1, right, value)
    else:
        if mid == 0 or searchArr[mid-1] != value:
            return mid
        else:
            return binary_find_first_same(searchArr, left, mid -1, value)

#二分查找最后一个相等的索引
def binary_find_last_same(searchArr: [], left: int,right: int, value: int):
    if left > right:
        return -1
    mid = left + (right-left)//2
    if searchArr[mid] > value:
        return binary_find_last_same(searchArr, left, mid -1, value)
    elif searchArr[mid] < value:
        return binary_find_last_same(searchArr, mid+1, right, value)
    else:
        if mid == right or searchArr[mid+1] != value:
            return mid
        else:
            return binary_find_last_same(searchArr, mid+1, right, value)

#二分查找第一个大于指定值的索引
def binary_find_first_big(searchArr: [], left: int, right: int, value: int):
    if left > right:
        return -1
    mid = left + (right-left)//2
    if searchArr[mid] > value:
        if mid == 0 or searchArr[mid-1] <= value:
            return mid
        else:
            return binary_find_first_big(searchArr, left, mid -1, value)
    else:
        return binary_find_first_big(searchArr, mid+1, right, value)

#二分查找第一个小于指定值的索引
def binary_find_first_less(searchArr: [], left: int, right: int, value: int):
    if left > right:
        return -1
    mid = left + (right - left) // 2
    if searchArr[mid] >= value:
        return binary_find_first_less(searchArr, left, mid - 1, value)
    else:
        if mid == right or searchArr[mid+1] >= value:
            return mid
        else:
            return binary_find_first_less(searchArr, mid + 1, right, value)