1.) What is the basic operation? (one word)

2.) Set up a recurrence relation for the algorithm's basic operation.

3.) Using your recurrence relation above, solve the relation. Your answer will be a formula in terms of n. C(n) = ?

Consider the following algorithm: Algorithm Riddle(A[0...n-1]) // Input: An array A[0...n1]) of real numbers if n=1, return A[0] else temp := Riddle(A[0...n-2]) if temp A[n1] return temp else return A[n1]