递归实现二分查找(Python2.7)

最新推荐文章于 2024-03-05 10:30:00 发布

kinwpf

最新推荐文章于 2024-03-05 10:30:00 发布

阅读量1.6k

点赞数

分类专栏：算法 Python 文章标签：二分查找递归算法 Python

本文链接：https://blog.csdn.net/king_wpf/article/details/52737884

版权

Python 同时被 2 个专栏收录

1 篇文章 0 订阅

订阅专栏

算法

0 篇文章 0 订阅

订阅专栏

<pre name="code" class="python"># _*_ coding: utf-8 _*_
#二分查找
def BinarySearch(lists, left, right, key, tag, mid = 0, found = False):
    count = len(lists[left:right+1]) + 1
    if tag == 0:
        mid = count // 2
    elif tag == 1:
        mid += count // 2
    else:
        mid -= count // 2

    if lists[mid] == key:
        found = True
    else:
        while left < right:
            if lists[mid] > key:
                right = mid
                tag = 2
                return BinarySearch(lists, left, right, key, tag, mid, found)
            elif lists[mid] < key:
                left = mid + 1
                tag = 1
                return BinarySearch(lists, left, right, key, tag, mid, found)
    if found:
        print key, 'found, index is ', mid
    elif left >= right and not found:
        print key, 'is not found in lists'

L = [1, 2, 3, 4, 5, 6, 7, 8, 9]
for i in range(0, 11):
    BinarySearch(L, key = i, left = 0, right=len(L)-1, tag = 0)