用python实现二分法

用python实现二分法

Python 二分法小程序

data_list = range(0,1000000, 2)

def binary_search(find_num,data):
    #5
    mid = int(len(data)/2)  #100/2 = 50  (此处需改成int，原版有错)
    if mid >0:
        if find_num >data[mid] : #find num should be in right
            print "data should in right",mid #data[mid:]
            binary_search(find_num,data[mid:])
        elif find_num < data[mid]: # find num should be in left
            print "data should in left",mid #data[:mid]
            binary_search(find_num, data[:mid])
        else: # find num equals to mid
            print "find the num:%s" % data[mid]
    elif data[0] == find_n :
        print "\033[32;1mfind the num:%s\033[0m" % data[mid]

    else:
        print 'cannot find the num', find_n


if __name__ == '__main__':
    find_n = raw_input("find:").strip()
    if find_n.isdigit():
        find_n = int(find_n)
        binary_search(find_n, data_list)

        if find_n in data_list:
            print '--->%s exist in list'

###########################寻找 55 过程
find:55
data should in left 250000
data should in left 125000
data should in left 62500
data should in left 31250
data should in left 15625
data should in left 7812
data should in left 3906
data should in left 1953
data should in left 976
data should in left 488
data should in left 244
data should in left 122
data should in left 61
data should in left 30
data should in right 15
data should in right 7
data should in right 4
data should in left 2
data should in right 1
cannot find the num 55

Process finished with exit code 0