What is the Big O notation for the following code: low = 0 high = len(arr)...

Transcribed Image Text:

What is the Big O notation for the following code: low = 0 high = len(arr) - 1 while low <= high: mid = (high + low) // 2 if arr[mid] < x: low = mid + 1 elif arr[mid] > x: high = mid-1 else: return mid return -1 What is the Big O notation for the following code: low = 0 high = len(arr) - 1 while low <= high: mid = (high + low) // 2 if arr[mid] < x: low = mid + 1 elif arr[mid] > x: high = mid-1 else: return mid return -1

Answer rating: 100% (QA)

The code snippet provided is an implementation of the binary search algorithm Binary search is a div... View the full answer