leq means less or equal,

XX is the name of the algorithm, A is a list.

4. Consider the following recursive algorithm: Algorithm XX(A[O..n-1]) if n=1 return A[0] else temp = XX(A[O..n-2]) if temp leq A(n-1) return temp else return A[n-1] Determine what the algorithm does, set up the recurrence relation and solve it to obtain its compu- tational complexity