What is the complexity of an array that find minimum of an array

Question

ALGORITHM Min1 (A[0..n - 1])
//Input: An array A [0..n — 1 ] of real numbers
if n = 1 
 return A [0]
else temp <— Min1 (A[0..n — 2])
if temp <= A [n — 1] 
  return temp
else return A [n — 1]

What is the recursion statement of this algorithm? What is the complexity? What is the asymptotic analysis of this algorithm?