Express a Brute-Force Algorithm That fiNds the Second Largest Element $( n \geq 2 )$

Essay

Express a brute-force algorithm that finds the second largest element in a list a₁, a₂, . . . , a_n $( n \geq 2 )$ of distinct integers by finding the largest element, placing it at the beginning of the sequence, then finding the largest element of the remaining sequence.