二分法

在一个数字集合中查找某个值存不存在

data = range(0,100000000)

# data = [1,3,5,10,11,12,14,17,19,19,20]

def binary_search(datasets,find_num):
    if len(datasets) >0:
        middle_pos = int(len(datasets)/2)
        if datasets[middle_pos] == find_num:
            #find it
            print("Find num:",datasets[middle_pos])
        elif datasets[middle_pos] > find_num:
            #data in left side
            print("33[31;1mgoing to left side33[0m",datasets[0:middle_pos],datasets[middle_pos])
            binary_search(datasets[0:middle_pos],find_num)
        else:#data in right side
            print("33[32;1mgoing to right side33[0m",datasets[middle_pos+1:],datasets[middle_pos])
            binary_search(datasets[middle_pos+1:],find_num)

    else:
        print("cannot find the num",find_num)

binary_search(data,5000004)