在python中搜索列表的最快方法

def binary_search(arr, target):
    low = 0
    high = len(arr) - 1

    while low <= high:
        mid = (low + high) // 2
        if arr[mid] == target:
            return mid
        elif arr[mid] < target:
            low = mid + 1
        else:
            high = mid - 1

    return -1

# 示例用法
my_list = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
target_value = 6
result = binary_search(my_list, target_value)
if result != -1:
    print("目标值在列表中的索引为:", result)
else:
    print("目标值不在列表中")