二分查找

二分查找 递归 Python

def binarySearch(lists,select):
    print 'coming',lists
    is_none=False
    if lists!=[]:
        cen_num=len(lists)/2
        tlag=lists[cen_num]
        gt_list=lists[0:cen_num]
        lt_list=lists[cen_num+1:]
            
        if tlag==select:
            return True
        elif tlag>select:
            is_se=binarySearch(lt_list,select)
            if is_se == True:
                return True
        elif tlag<select:
            is_se=binarySearch(gt_list,select)
            if is_se == True:
                return True
                    
    return is_none


a = [20,18,16,13,11,8,7,4,2,1]

print binarySearch(a,19)

二分查找

原文：http://blog.csdn.net/u012063703/article/details/45935569