Python实现二分法查找

二分法查找：

def binary_search(num_list, x):
    '''
    二分查找
    '''
    num_list=sorted(num_list)
    left, right = 0, len(num_list)
    while left < right:
        mid = (left + right) / 2
        if num_list[mid] > x:
            right = mid
        elif num_list[mid] < x:
            left = mid + 1
        else:
            return '待查元素{0}在列表中下标为：{1}'.format(x, mid)
    return  '待查找元素%s不存在指定列表中'%x
 
 
 
if __name__ == '__main__':
    num_list = [34,6,78,9,23,56,177,33,2,6,30,99,83,21,17]
    print binary_search(num_list, 34)
    print binary_search(num_list, 177)
    print binary_search(num_list, 21)
    print binary_search(num_list, 211)
    print binary_search(num_list, 985)