Python 递归实现二分查找

最新推荐文章于 2024-03-16 00:36:36 发布

加油girl！

最新推荐文章于 2024-03-16 00:36:36 发布

阅读量993

点赞数 1

分类专栏： python学习笔记

本文链接：https://blog.csdn.net/Vonzhuxi/article/details/83507179

版权

python学习笔记专栏收录该内容

2 篇文章 0 订阅

订阅专栏

def binarychop(lst, target, head, tail):
    if  isinstance(lst, list):
	    if len(lst) == 0:
			return -1
		head = head
		tail = tail
		target = target
		middle = (head + tail) // 2
		
		if lst[middle] == target:
			return 1
		elif lst[middle] > target:
			if tail == 0 or tail < head:
				return -1
			else:
				tail -= 1
				return binarychop(lst, target, head, tail)
		else:
			if head == len(lst) - 1 or head > tail:
				return -1
			else:
				head += 1
				return binarychop(lst, target, head, tail)
	else:
		return -1