如何找出一个数组中第二大的数

#include <stdio.h>
const int MINNUMBER = -32767;
int FindSecMax(int data[],int count)
{
int maxnumber = data[0];
int sec_max = MINNUMBER;
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;
}
int main()
{
int array[] = {2,5,6,7,7,8,98,3,458,5,6};
int length = sizeof(array)/sizeof(array[0]);
printf("%d\n",FindSecMax(array,length); //98
return 0;
}