def findMin(arr): print(“Finding min in a…
Anonymous - Sep 4, 2014
def findMin(arr):
print(“Finding min in a rotated sorted array of integers”)
low = 0
high = len(arr) - 1
while low < high:
mid = int((low + high)/2)
left = mid - 1
right = high
if arr[mid] > arr[left] and arr[mid] > arr[right]:
low = mid
elif arr[mid] > arr[left] and arr[mid] < arr[right]:
high = mid
else:
return arr[mid]