Question: Consider the following algorithm ALGORITHM FindA[p..r]) if p ==r return A[p] else temp1 = Find(A[[p + r)/2] +1..r]) if temp 1 lessthanorequalto temp2 return temp1
![Consider the following algorithm ALGORITHM FindA[p..r]) if p ==r return A[p]](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2024/09/66f51d22da491_81066f51d221c4c9.jpg)
Consider the following algorithm ALGORITHM FindA[p..r]) if p ==r return A[p] else temp1 = Find(A[[p + r)/2] +1..r]) if temp 1 lessthanorequalto temp2 return temp1 else return temp2 a. What does this algorithm compute? b. Set up a recurrence relation for the algorithm's basic operation count and solve it. You may assume that the array A has 2elements
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
