$//$ Algorithm Secret $($A $[0...$ n$-1])$

$//$ Input : An array A $[0...$ n$-1]$ of n real numbers

minval $=$ A$[0]$ ; maxval $=$ A$[0]$

for i $=1$ to n$-1$ do

if A$[$i$]<$ minval

minval $=$ A$[$i$]$

if A$[$i$]>$ maxval

maxval $=$ A$[$i$]$

return maxval $-$ minval what is the runtime of this algorithm and show order of growth