Second Minimum
Second Minimum Search Second minimum search finds the element that is strictly larger than the minimum and as small as possible. It extends minimum search by tracking two candidates. This is useful in ranking, selection, and tournament based algorithms. Problem Given a sequence $A$ of length $n$, find an index $i$ such that $$ A[i] = \min {, A[j] \mid A[j] > \min(A) ,} $$ If no such element exists,...