What is the Big-O of the following function? Note: Python’s…
What is the Big-O of the following function? Note: Python’s built-in sort uses Timsort, which is O(n log n).predef sort_and_search(arr, target): arr.sort() left, right = 0, len(arr) – 1 while left = right: mid = (left + right) // 2 if arr == target: return mid elif arr target: left = mid + 1 else: right = mid – 1 return -1/pre