无重复数字的升序数组的查找

方法一：index查找

def search(array,num):
    try:
        index=array.index(num)
    except ValueError:
        return -1
    else:
        return index 

方法二：二分查找

def search(array,num):
    low = 0 
    high = len(array) - 1 
    while low <= high :
        mid = (low + high )//2 
        if array[mid] == num :
            return mid 
        elif array[mid] > num :
            high = mid - 1 
        else :
            low = mid + 1
    else :
        return -1