二分查找_python

最新推荐文章于 2020-11-24 03:38:53 发布

瑶子ove

最新推荐文章于 2020-11-24 03:38:53 发布

阅读量150

点赞数 1

分类专栏：面试手写题目

本文链接：https://blog.csdn.net/weixin_40924580/article/details/85265775

版权

面试手写题目专栏收录该内容

5 篇文章 0 订阅

订阅专栏

1、循环非递归方法：

def binarySearch(c,k):
    l=0
    r=len(c)-1
    while l<=r:
        mid = (l+r)//2
        if k < c[mid]:
            r = mid - 1
        elif k > c[mid]:
            l = mid + 1
        else:
            return mid
    return -1


if __name__ == '__main__':
    c = [10, 11, 12, 17, 19, 21, 22, 24, 32, 38, 49, 51, 66, 78, 90]
    b=binarySearch(c,10)
    print(b)

2、递归实现

def binarySearch(c,k,l,r):
    while l<=r:
        mid = (l+r)//2
        if k > c[mid]:
            return binarySearch(c,k,mid+1,r)
        elif k < c[mid]:
            return binarySearch(c,k,l,mid-1)
        else:
            return mid
    return -1


if __name__ == '__main__':
    c = [10, 11, 12, 17, 19, 21, 22, 24, 32, 38, 49, 51, 66, 78, 90]
    l=0
    r=len(c)-1
    ans = binarySearch(c,22,l,r)
    print(ans)