两种不用的思想实现二分查找算法Python实现

最新推荐文章于 2023-01-09 23:48:04 发布

Chauncy__xu

最新推荐文章于 2023-01-09 23:48:04 发布

阅读量110

点赞数

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

本文链接：https://blog.csdn.net/qq_44384577/article/details/107296015

版权

数据结构专栏收录该内容

8 篇文章 0 订阅

订阅专栏

文章目录

- - 利用指针的思想实现二分查找算法
  - 利用递归的思想实现二分查找算法

利用指针的思想实现二分查找算法

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
            return midpoint
        elif alist[midpoint] > item:
            last = midpoint - 1
        else:
            first = midpoint + 1
    return found
L1 = [1,2,4,5,6,7,20,35,55,65,73,82,432,450]
print(binarySearch(L1,5))

利用递归的思想实现二分查找算法

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

L1 = [1,2,4,5,6,7,20,35,55,65,73,82,432,450]
print(binarySearch1(L1,6))