Express a brute-force algorithm that finds the second largest element in a list a1, a2, . . . , an (n ≥ 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.

Question

Express a brute-force algorithm that finds the second largest element in a list  a1, a2, . . . , an (n ≥ 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.

Quizplus · Accepted Answer

The Answer of Express a brute-force algorithm that finds the second largest element in a list  a1, a2, . . . , an (n ≥ 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.

Express a Brute-Force Algorithm That Finds the Second Largest Element