用python 实现的二分查找:

#用python 实现的二分查找:

 def halfSearch(num):
    isFound = False
    for i in range(half+1):
        if num in lis[:half+1]:  #在[0,half]中查找.
            print('num %f Already found in front part!/n',num)
            isFound = True
            break
        elif not isFound:        #若未找到，则在[half+1,结尾]查找.
            for i in range(half+1,lenth+1):
                if num in lis[half+1:]:
                    print('num %f Already found in back part!/n' % num)
                    isFound = True
                    break
    if not isFound:
        print('num %f not found!/n' % num)