public class SecondMax {
    public static int FindSecMax(int[] data) {
        int count = data.length;
        int maxnumber = data[0];
        int sec_max = Integer.MIN_VALUE;
        for(int i = 1;i<count;i++) {
            if(data[i]>maxnumber) {
                sec_max = maxnumber;
                maxnumber=data[i];
            }
            else {
                if(data[i]>sec_max)
                    sec_max = data[i];
            }
        }
        return sec_max;
    }
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        int[] array = {7,3,19,40,4,7,1};
        System.out.println(FindSecMax(array));
    }

}
 

求數組第二大的數（選擇排序）