编辑代码

def binary_search(arr, target):
    left, right = 0, len(arr) - 1
    while left <= right:
        mid = left + (right - left) // 2
        if arr[mid] == target:
            return mid
        elif arr[mid] < target:
            left = mid + 1
        else:
            right = mid - 1
    return -1

# 主函数进行测试
def main():
    arr = [6, 17, 25, 34, 52, 63, 85]
    target = 6
    result = binary_search(arr, target)
    if result != -1:
        print(f"元素 {target} 存在于数组中，索引为 {result}")
    else:
        print(f"元素 {target} 不存在于数组中")

if __name__ == "__main__":
    main()