Suppose you are given an array A[0..n-1] of sorted integers that has been circularly shifted k positions to the right. F

[answerhappygod]

Suppose you are given an array A[0..n-1] of sorted
integers that has been circularly shifted k positions to
the right. For example, [35, 42, 5, 15, 27, 29] is a
sorted array that has been circularly shifted k =
2 positions, while [27, 29, 35, 42, 5, 15] has been
shifted k = 4 positions. Implement the following
function find_largest that finds the
largest item in this array in O(log n) time
complexity.
def find_largest(a,low,high): # find the
largest in array a in range from a[low] to a[high]