python从零学习day-3 homework:递归函数实现二分查找
def search(x,list):
'''
实现二分法
:param x:int
:param list:list
:return:
'''
n = int(len(list))
if list:
if x == list[int(n/2)]:
print('get it!')
elif x > list[int(n/2)]:
search(x, list[int(n/2):])
else:
search(x,list[0:int(n/2)])
else:
print('找不到')
a = [1,3,4,6,7,8,9,11,15,17,19,21,22,25,29,33,38,69,107]
search(1,a)