二分法查找（前提序列有序）

#encoding=utf-8
def BinarySearch(arr,aimNum):
    start = 0
    end = len(arr)-1
    mid = int((start+end)/2)
    while True:
        if aimNum>arr[mid]:
            start = mid+1
            mid = int ((start + end) / 2)
        elif aimNum<arr[mid]:
            end = mid - 1
            mid = int ((start + end) / 2)
        else:
            return mid+1
            break
if __name__ == "__main__":
    aimAin = [1,2,12,45,78,90]
    print BinarySearch(aimAin,45)