利用数组进行数据查找

折半查找法：针对有序数组

def halfSearch(key, array, begin, end):
    if begin > end:
        return -1
    middle = (begin + end)/2
    #print begin, end,array[middle]
    if array[middle] == key:
        return middle
    elif array[middle] > key:
        return halfSearch(key, array, begin, middle-1)
    else:
        return halfSearch(key, array, middle+1, end)

array = [-12,0,6,16,23,56,80,100,110,115]
for i in array:
    print halfSearch(i, array, 0, len(array)-1)