A22291. 下面程序中，函数query的时间复杂度是（ ）。def query(n, a, x): left = 0 right = n while left < right: mid = left + (right - left) // 2 if a[mid] >= x: right = mid else: left = mid + 1 if left == n: return -1 return lef…

下面程序中，函数query的时间复杂度是（    ）。

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

if __name__ == "__main__":
    n = 10
    x = 3
    num = [1, 2, 2, 3, 3, 4, 5, 5, 6, 7]
    print(query(n, num, x))