给出n => 2个正整数的数组A,要求您找到第二个A中的最大数字。
int biggest = -99999999
int second = -99999999
for i = 0 ... n-1
| if A[i] >= biggest
| | second = biggest
| | biggest = A[i]
| else if A[i] >= second
| | second = A[i]
return second
由于我们只查找数组的每个元素一次,所以复杂度为O(n)。