二分查找

def binary_search (sort_list,item) :
    length = len(sort_list)

    low = 0;
    high = length -1 
    

    
    while low<=high :
        mid = (high-low) // 2
        current_item = sort_list[mid]
        if current_item == item:
            return item
        if current_item < item :
            high = mid-1
        if current_item > item :
            low =  mid+1

    return none
        
if __name__ == '__main__' : 
    sort_list = [1,3,5,9,18,21,30,44,62]
    user_input = int(input("请输入查找的数字:\n"))

    result = binary_search(sort_list,user_input)
    print(result)