找出整数数组中第二大数

#include <iostream>
using namespace std;
int sort(int *a, int size)
{
int i;
int first = a[0];
int second = a[0];
for (i = 1; i < size; i++)
{
if (first == second)                    //去重
{
if (a[i] > first)
{
second = first;
first = a[i];
}

else
second = a[i];
}
else
{
if (a[i] > second)
{
if (a[i] > first)
{
second = first;
first = a[i];
}
else
second = a[i];
}
}

}
return second;
}
int main()
{
int a[] = {9,8,5,7,3,4,2,1,6,0};
int c[] = {1,2,3,4,5,6,7,8,9,0};
int e[] = { 8,9,7,6,5,4,3,2,1,0};
int n[] = { 9,9,2,4,5,6,7,8,2,3};
int b = sort(e, 10);
int d = sort(n, 10);
cout << b<< endl;
cout << d << endl;
return 0;
}