寻找数组中的第二大数

休养三年之后重新找工作, 感觉各种思维没以前好了, 也不知道是否适合干以前的工作.

#include <stdlib.h>
#include <stdio.h>

int Get2ndNum(int a[], int arrLen)
{
	int firNum = a[0], secNum = 0;
	int i = 0;

	if (arrLen == 1)
	{
		secNum = firNum;
		return secNum;
	}

	secNum = a[1];
	for (i = 1; i < arrLen; i++)
	{
		if (a[i] > firNum)
		{
			secNum = firNum;
			firNum = a[i];
		}
		else if (a[i] < firNum && a[i] > secNum)
		{
			secNum = a[i];
		}
		else if (firNum == secNum)
		{
			secNum = a[i];
		}
	}

	return secNum;
}

int main(int argc, char ** argv)
{
	int numMax;
	int *numArr;
	int i = 0;
	int sec = 0;

	printf("Need to enter a few numbers? ");
	scanf("%d", &numMax);
	printf("\n");

	numArr = (int *)malloc(sizeof(int)*numMax);
	if (numArr == NULL)
	{
		printf("Application memory failed.");
		return -1;
	}
	printf("Please enter the number of columns: ");
	for (i = 0; i < numMax; i++)
	{
		scanf("%d", &numArr[i]);
	}
	printf("\n");

	sec = Get2ndNum(numArr, numMax);
	printf("The second largest number is: %d\n", sec);
	free(numArr);
	return 0;
}