def Search (arr, l, r, x):
if r >= l:
mid = int(l + (r - l)/2)
if arr[mid] == x:
return mid
elif arr[mid] > x:
return Search(arr, l, mid-1, x)
else:
return Search(arr, mid+1, r, x)
else:
return -1
arr = [ 0,1,2, 3, 4, 5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25] #自定义的数组
x=int(input('请输入你想查找的数字:'))
result = Search(arr, 0, len(arr)-1, x)
if result != -1:
print ("元素在数组中的索引为 %d" % result )
else:
print ("元素不在数组中,查找结束")
二分法查找数字
最新推荐文章于 2024-07-19 23:41:27 发布