Top10：数据结构-排序和搜索-二分查找-python

最新推荐文章于 2024-10-02 10:53:34 发布

Carl_blog

最新推荐文章于 2024-10-02 10:53:34 发布

阅读量142

点赞数

分类专栏：数据结构&算法文章标签： python 数据结构算法

本文链接：https://blog.csdn.net/qq_43457383/article/details/108336709

版权

数据结构&算法专栏收录该内容

2 篇文章 0 订阅

订阅专栏

Top10：数据结构-排序和搜索-二分查找-python

实现一：
实现二：

实现一：

"""
@Time:  2020/9/1/001   10:57
@Author:  Carl
@File:  binarySearchDemo
@Software:  PyCharm Professional Edition
"""


def binarySearch(alist, item):
    first = 0
    last = len(alist) - 1
    found = False
    while first <= last and not found:
        midpoint = (first + last) // 2
        if alist[midpoint] == item:
            found = True
        else:
            if item < alist[midpoint]:
                last = midpoint - 1
            else:
                first = midpoint + 1
    return found


testlist = [0, 1, 2, 8, 13, 17, 19, 32, 42, ]
print(binarySearch(testlist, 3))
print(binarySearch(testlist, 13))

实现二：

def binarySearch(alist, item):
    if len(alist) == 0:
        return False
    else:
        midpoint = len(alist) // 2
        if alist[midpoint] == item:
            return True
        else:
            if item < alist[midpoint]:
                return binarySearch(alist[:midpoint], item)
            else:
                return binarySearch(alist[midpoint + 1:], item)


testlist = [0, 1, 2, 8, 13, 17, 19, 32, 42, ]
print(binarySearch(testlist, 3))
print(binarySearch(testlist, 13))