查找数组中第二大或者第二小的数值

给出一个无序数组，找出其中的第二大或者第二小的数值，下面给出详细代码，仅供参考。

#include <stdio.h>
int FindSecondBiggest(int* v, int len)
{
    if (v == NULL || len < 2)
    {
        return -1;
    }
    
    int i,max = v[0],second = v[1];
    if (max < second)
    {
        max = v[1];
        second = v[0];
    }
    
    for (i = 2; i < len; i++)
    {
        if (v[i] > max)
        {
            second = max;
            max = v[i];
        }else if(v[i] > second)
        {
            second = v[i];
        }
    }
    return second;
}

int FindSecondLeast(int* v,int len)
{
    if (v == NULL || len < 2)
    {
        return -1;
    }
    
    int i, min = v[0],second = v[1];
    if (min > second)
    {
        min = v[1];
        second = v[0];
    }
    for (i = 2; i < len; i++)
    {
        if (v[i] < min)
        {
            second = min;
            min = v[i];
        }else if(v[i] < second)
        {
            second = v[i];
        }
    }
    return second;
}

int main(int argc, const char * argv[]) {
    printf("Hello, World!\n");
    
    int v[] = {1,2,3,4,5,6,7,8,9};
    int len = sizeof(v) / sizeof(v[0]);
    printf("SecondBiggest = %d\n",FindSecondBiggest(v, len));
    printf("SecondLeast = %d\n",FindSecondLeast(v,len));
    return 0;
}