Answer
procedure largest($a_1, a_2, ... a_n:$ a set of integers)
largest $:=1$
for $i:=2$ to $n$
$\space\space\space$$\space\space\space$if $a_i>a_{largest}$ then largest $:= i$
return largest
Work Step by Step
This algorithm attempts to find the first occurrence of the largest element. Note that we ensure this by having a strict inequality. Any later occurrences of the largest element would not pass the condition and hence we will always return the index of the first occurrence.
