在我的二进制搜索算法中，Python 在列表中找不到 0 个索引成员

Question

我该如何修复代码 - 该算法会找到所有情况下的搜索号码，除非您尝试查找 0 索引号码或在我的情况下 search_num = 1.

list1 = [1, 3, 4, 5, 19, 21, 52, 100, 152]
search_num = 1

def binarySearch(array, number):

    lower_b_index = 0
    upper_b_index = len(array) - 1

    while lower_b_index <= upper_b_index:

        mid_point = (lower_b_index + upper_b_index) // 2

        if array[mid_point] == number:
            return mid_point
        elif array[lower_b_index] == number:
            return lower_b_index
        else:
            if array[mid_point] < number:
                lower_b_index = mid_point + 1
            else: 
                upper_b_index = mid_point - 1 

    return False

a1 = binarySearch(list1, search_num)

if a1:
    print("The searched position: ", a1 + 1)
else:
    print("Not Found!")

Answer 1

您的问题不在您的 binarySearch 算法中，而是您之后的 if 语句。

你的算法 returns a1 = 0 是正确的，你的检查 if 0 和 0 是布尔值到 False

一个简单的解决方法是 return None 并检查 if a1 is not None

list1 = [1, 3, 4, 5, 19, 21, 52, 100, 152]
search_num = 1

def binarySearch(array, number):

    lower_b_index = 0
    upper_b_index = len(array) - 1

    while lower_b_index <= upper_b_index:

        mid_point = (lower_b_index + upper_b_index) // 2

        if array[mid_point] == number:
            return mid_point
        elif array[lower_b_index] == number:
            return lower_b_index
        else:
            if array[mid_point] < number:
                lower_b_index = mid_point + 1
            else: 
                upper_b_index = mid_point - 1 

    return None  # Change here

a1 = binarySearch(list1, search_num)

if a1 is not None:  # Change here
    print("The searched position: ", a1 + 1)
else:
    print("Not Found!")

在我的二进制搜索算法中，Python 在列表中找不到 0 个索引成员

In my binary search algorithm, Python doesn't find 0 indexed member in the list

binary-search

python-3.x