二分查找算法

二分查找 python实现

class binary_search:
    def binary_searchway(self, list, item):
        low = 0
        high = len(list) - 1

        while low <= high:
            mid = int((low + high)/2)
            guess = list[mid]
            if guess == item:
                return mid
            if guess > item:
                high = mid - 1
            else:
                low = mid + 1
        return None


My_list = [1, 3, 5, 7, 9, 11, 13]
solution = binary_search()
item_index = solution.binary_searchway(My_list, 5)
print(item_index)