blob: 2f7f2996ca99bd441abb3e9d94c41265b773f89c (
plain)
1
2
3
4
5
6
7
8
9
10
|
def find_Min(arr,low,high):
while (low < high):
mid = low + (high - low) // 2;
if (arr[mid] == arr[high]):
high -= 1;
elif (arr[mid] > arr[high]):
low = mid + 1;
else:
high = mid;
return arr[high];
|