如何避免使用Index()方法对大型列表进行缓慢搜索

def binary_search(sorted_list, target):
    low = 0
    high = len(sorted_list) - 1
    while low <= high:
        mid = (low + high) // 2
        if sorted_list[mid] == target:
            return mid
        elif sorted_list[mid] < target:
            low = mid + 1
        else:
            high = mid - 1
    return -1  # 如果未找到目标

# 示例
sorted_list = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
target = 7
print(binary_search(sorted_list, target))  # 输出: 6

def create_hash_table(data_list):
    hash_table = {}
    for index, value in enumerate(data_list):
        hash_table[value] = index
    return hash_table

def search_hash_table(hash_table, target):
    return hash_table.get(target, -1)

# 示例
data_list = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
hash_table = create_hash_table(data_list)
target = 7
print(search_hash_table(hash_table, target))  # 输出: 6