代码:
#二分查找法:前提是该数组是有序数组 print(7/2) print(7//2) print(1//2) #查找给定的数字,如果存在,返回索引,否则,返回-1 def BinarySearch(array, number): low = 0 high = len(array) -1 while low <= high: mid = (low+high)//2 if array[mid] < number: low = mid + 1 elif array[mid] > number: high = mid -1 else: return mid return -1 array1=[1,2,3,34,56,57,78,87] array2 = [1] print(BinarySearch(array2, 1))