tag:blogger.com,1999:blog-3098638925089993315.post3739603115361756960..comments2023-04-26T19:21:06.970+05:30Comments on KodeKnight: Find the minimum element in the rotated sorted sorted arrayKinshuk Chandrahttp://www.blogger.com/profile/01344610750518430564noreply@blogger.comBlogger1125tag:blogger.com,1999:blog-3098638925089993315.post-73675152394998716492014-09-18T07:25:29.009+05:302014-09-18T07:25:29.009+05:30def findMin(arr):
print("Finding min in a...def findMin(arr):<br /> print("Finding min in a rotated sorted array of integers")<br /><br /> low = 0<br /> high = len(arr) - 1<br /> while low < high:<br /> mid = int((low + high)/2)<br /> left = mid - 1<br /> right = high<br /> <br /> if arr[mid] > arr[left] and arr[mid] > arr[right]:<br /> low = mid<br /> elif arr[mid] > arr[left] and arr[mid] < arr[right]:<br /> high = mid<br /> else:<br /> return arr[mid]<br /> Anonymousnoreply@blogger.com