0:00
Round 1 / 40 correct
What is the time complexity?
Python1def binary_search(arr, target):
2 lo, hi = 0, len(arr) - 1
3 while lo <= hi:
4 mid = (lo + hi) // 2
5 if arr[mid] == target: return mid
6 elif arr[mid] < target: lo = mid + 1
7 else: hi = mid - 1