Python实现二分查找(递归与非递归)

最新推荐文章于 2023-07-29 00:00:03 发布

QYiRen

最新推荐文章于 2023-07-29 00:00:03 发布

阅读量952

点赞数 2

分类专栏： Python 文章标签： python 算法开发语言

本文链接：https://blog.csdn.net/qq_42433311/article/details/123246480

版权

Python 专栏收录该内容

31 篇文章 5 订阅

订阅专栏

#二分查找时间复杂度最好为O(1),最坏为O(logn)
def binary_search(alist, item):
    """递归实现二分查找"""
    n = len(alist)
    if n > 0:
        mid = n // 2
        if alist[mid] == item:
            return True
        elif alist[mid] > item:
            return binary_search(alist[:mid], item)
        else:
            return binary_search(alist[mid + 1:], item)

    return False

li = [1, 2, 3, 4, 5, 6]
res = binary_search(li, 6)
print(res)

def binary_search1(alist, item):
    """非递归实现二分查找"""
    n = len(alist)
    low = 0
    high = n - 1
    while low <= high:
        mid = (low + high) // 2
        if alist[mid] == item:
            return True
        elif alist[mid] > item:
            high = mid - 1
        else:
            low = mid + 1
    return False

li = [1, 2, 3, 4, 5, 6]
res = binary_search1(li, 6)
print(res)