二分法查找的递归和非递归两种算法

最新推荐文章于 2021-12-07 21:43:48 发布

彩云的笔记

最新推荐文章于 2021-12-07 21:43:48 发布

阅读量2.6k

点赞数

CC 4.0 BY-SA版权

分类专栏： python

本文链接：https://blog.youkuaiyun.com/CAIYUNFREEDOM/article/details/91493844

python 专栏收录该内容

62 篇文章

订阅专栏

本文深入探讨了二分查找算法的实现原理，包括迭代和递归两种方式，并通过具体示例展示了算法的运行过程。文章提供了清晰的代码示例，帮助读者理解如何在已排序的数组中高效查找目标元素。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

def binaryS(data, num):
    l = 0
    r=len(data)-1
    find = False
    mid = 0
    while True:
      if(l>r):
        break
      mid = (r+l)/2
      if(num> data[mid]):
        l = mid+1
      elif(num<data[mid]):
        r = mid-1
      else:
        find = True
        break
    print mid,data[mid],'find=',find


def binaryS_iter(data, num,l,r):
      if(l>r):
          return -1
      mid = (r+l)/2
      if(num> data[mid]):
          l = mid+1
          return binaryS_iter(data,num,l,r)
      elif(num<data[mid]):
          r = mid-1
          return binaryS_iter(data,num,l,r)
      else:
          #print 'in func\n',mid,data[mid]
          return mid

binaryS([1,3,7,10,33,44,56],44)
binaryS([1,3,7,10,33,44,56],1)
binaryS([1,3,7,10,33,44,56],2)
binaryS([1,3,7,10,33,44,56],45)

ind =binaryS_iter([1,3,7,10,33,44,56],44,0,6)
print 'ind=',ind
ind=binaryS_iter([1,3,7,10,33,44,56],1,0,6)
print 'ind=',ind
print binaryS_iter([1,3,7,10,33,44,56],2,0,6)
print binaryS_iter([1,3,7,10,33,44,56],45,0,6)