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

Question

Quizplus · Accepted Answer

The Answer is procedure secondmax(a₁, a₂, . . . , a_n : integers)
$procedure secondmax(a1, a2, . . . , an : integers) return secondmax \{secondmax is the second largest element \}$
return secondmax \{secondmax is the second largest element

\}

Express a Brute-Force Algorithm That ﬁNds the Second Largest Element (n≥2)( n \geq 2 )(n≥2)

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