Find the position of the smallest number in a sequence

Input: A sequence $S$ of $n$ numbers $\{a_1,a_2,$dots,$a_n\},$ where

$a_1{a}_2$dots$a_n$

Output: pos, the position of the smallest element in the input

sequence

pos larr$0$;

minlarrS$[0]$

ilarr$1$;

while larriminlarrS$[i]$;ilarri$+1$;$,S[i]$ then

pos larri;

minlarrS$[i]$;

end

ilarri$+1$;$,$ Analyze this algorithm:

end

Best$-$case?

Worst$-$case?$ido$

$ifS[i]$ then

pos larri;

minlarrS$[i]$;

end

ilarri$+1$;$,$ Analyze this algorithm:

end

Best$-$case?

Worst$-$case?