Could someone please show step by step how this works for A = [2, 10, 18, 65, 212]

I'm having trouble in particular with the line:

if temp

please explain how this finds the smallest value in the array.

Here is the algorithm and solution:

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