Question

ALGORITHM Rid(A[0..n − 1])

if n = 1 return A[0]
else temp ← Rid(A[0..n − 2])
if temp ≤ A[n − 1] return temp
else return A[n − 1]

time complexity and find tight bound

Answer 1

Answer:

what are you saying

Explanation:

can't understand