找出数组中第二大的数

#include <iostream>

int Find2ndMax(int* a, int n)
{
	int max = a[0];
	int subMax = a[1];

	if (subMax > max)
	{
		int temp = max;
		max = subMax;
		subMax = temp;
	}

	for (int i = 2; i < n; i++)
	{
		if (a[i] > max)
		{
			subMax = max;
			max = a[i];
		}
		else if(a[i] > subMax)
		{
			subMax = a[i];
		}
	}


	return subMax;
};


int main(int argc,char *argv[])  
{  
    int a[10] = {25, 28, 3, 4, 5, 6, 27, 8, 9, 10};  
  
    int _2ndMax = Find2ndMax(a, 10);  
  
    return 0;  
}