比较有序列表中的值

# 定义一个有序列表
ordered_list = [1, 3, 5, 7, 9]

# 插入新元素并保持有序
new_element = 4
insert_index = 0
while insert_index < len(ordered_list) and ordered_list[insert_index] < new_element:
    insert_index += 1
ordered_list.insert(insert_index, new_element)

print("插入新元素后的有序列表:", ordered_list)

# 使用二分查找定位元素
def binary_search(arr, x):
    low = 0
    high = len(arr) - 1
    mid = 0

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

element_to_find = 5
result = binary_search(ordered_list, element_to_found)
if result != -1:
    print(f"元素 {element_to_find} 在索引 {result}")
else:
    print("元素不在列表中")