Question: By using Master's Theorem find the time complexity of this algorithm def Max(A) n=len(A) h=n//2 left= A[0:h] right= A[h:n] if n==1: return A[0] else: if
By using Master's Theorem find the time complexity of this algorithm
def Max(A)
n=len(A)
h=n//2
left= A[0:h]
right= A[h:n]
if n==1:
return A[0]
else:
if Max(left) >= Max(right):
return Max(left)
else:
return Max(right)
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock