2. Consider the following recursive algorithm: Algorithm Recursive(A[0..n-1]) //Input: A non-empty list A[0..n-1] of real numbers...

 

Transcribed Image Text:

2. Consider the following recursive algorithm: Algorithm Recursive(A[0..n-1]) //Input: A non-empty list A[0..n-1] of real numbers //Output: ? == if n else do 1 return A[0] value = Recursive(A[0..n-2]) if value > A[n-1] return value else return A[n-1] end if What does the algorithm produce? Establish and solve the recurrence relation for the total number of element comparisons (value> A[n-1]) performed by the algorithm. 2. Consider the following recursive algorithm: Algorithm Recursive(A[0..n-1]) //Input: A non-empty list A[0..n-1] of real numbers //Output: ? == if n else do 1 return A[0] value = Recursive(A[0..n-2]) if value > A[n-1] return value else return A[n-1] end if What does the algorithm produce? Establish and solve the recurrence relation for the total number of element comparisons (value> A[n-1]) performed by the algorithm.