K12教育赛事综合服务平台
专注青少年竞赛题库网站
聚乐之家官方网站
下载聚乐之家官方App
def binary_search(arr, x): low = 0 high = len(arr) - 1 while low <= high: { } return -1
mid = (low + high) // 2 if arr[mid] == x: return mid elif arr[mid+1] > x: high = mid - 1 else: low = mid + 1
mid = (low + high) // 2 if arr[mid] != x: return mid elif arr[mid+1] > x: high = mid - 1 else: low = mid + 1
mid = (low + high) // 2 if arr[mid] == x: return mid elif arr[mid] > x: high = mid - 1 else: low = mid + 1
mid = (low + high) // 2 if arr[mid] != x: return mid elif arr[mid] > x: high = mid - 1 else: low = mid + 1