Question

Algorithm find(a[0..n‐1]) if n ==1 return a[0] else temp = find(a[0..n‐2]) if temp ≤ a[n‐1] return temp else return a[n‐1]

a. what does this algorithm compute?

b. set up a recurrence relation for the algorithm's basic operation count and solve it.

Answer 1

cant understand your question brother