BinarySearch(L, int n, int x)
    lo = 1, hi = n
    while lo <= hi
        mid = lo + (hi-lo)/2
        if L[mid] == target
            return mid
        else if L[mid] < target
            lo = mid+1
        else 
            hi = mid-1
    return -1 //not found