Compute the time and space complexity of the following algorithms by following a detailed step by step procedure.

ALGORITHM test(A[0..n 1])

if n = 1 return A[0]

elsefor(int i=0, i

If (A[i] < A[i+1])

swap(arr[i], arr[i+1]);

temp test(A[0..n 2]);

if temp A[n 1]

return temp

else return A[n 1]