编辑代码

def binary_search(arr, k):
    left, right = 0, len(arr) - 1

    while left <= right:
        mid = (left + right) // 2
        mid_element = arr[mid]

        if mid_element == k:
            return True
        elif mid_element > k:
            right = mid - 1
        else:
            left = mid + 1

    return False

# 主函数进行测试
arr = [85, 63, 52, 34, 25, 17, 6]
target_element = 6

result = binary_search(arr, target_element)
print(f"元素 {target_element} 是否存在: {result}")