函数查找一个整数数组中第二大的数

#include <iostream>

using namespace std;

const int MINNUMBER = -32767;

int find_set_max(int data[], int count)

{

int maxnumber = data[0];

int sec_max = MINNUMBER;

for (int i = 1; i < count; i ++ )

{

if (maxnumber < data[i])

{

sec_max=maxnumber; //1

maxnumber=data[i]; //2

}

else

{

if (data[i] > sec_max)

sec_max=data[i]; //3

}

}

return sec_max;

}

int main()

{

int a[]={11,1,3,5,7,9,10,2,4,6};

cout<<find_set_max(a,9)<<endl;

return 0;

}