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

从一个给定的、无序的数组中，找出第二大或者第二小的数值。

#include <stdio.h>

int FindSecondBiggest(int *v, int len)
{
	if (v == NULL || len < 2) {
		return 0xfffffff;
	}

	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 0xffffffff;
	}

	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 v[] = {1,2,3};
	int len = sizeof(v) / sizeof(v[0]);
	printf("SecondBiggest = %d\n", FindSecondBiggest(v, len));
	printf("SecondLeast = %d\n", FindSecondLeast(v, len));
	return 0;
}