binary_search.py

def binary_search(a, x):
    left, right = 0, len(a)-1
    while left <= right:
        mid = (left+right)//2
        if x == a[mid]:
            return mid
        elif x < a[mid]:
            right = mid-1
        else:
            left = mid+1
    return -1

# def linear_search(a, x):
#     for i in range(len(a)):
#         if a[i] == x:
#             return i
#     return -1

if __name__ == '__main__':
    data = list(map(int, input().split()))
    n = data[0]
    a = data[1 : n + 1]
    search = list(map(int, input().split()))
    for x in search[1:]:
        print(binary_search(a, x), end = ' ')
    print()