求出整形数组中第二大的数的值

 1 int findsecond(int a[], int size)
 2 {
 3     int max = a[0];
 4     int second = a[1];
 5     int index = 0;
 6     for (int i = 0; i < size; ++i)
 7     {
 8         if (max < a[i])
 9         {
10             second = max;
11             index = i;
12             max = a[i];
13         }
14         else if (max > a[i])
15         {
16             if (second < a[i])
17             {
18                 second = a[i];
19                 index = i;
20             }
21             else if (second > a[i])          
22             {
23                 if (second == max)
24                 {
25                     second = a[i];
26                     index = i;
27                 }
28             }
29         }
30     }
31 
32     return second;
33 }