找出一个整形数组中第二大的值

int Findarr(int arr[], int sz)
{
	//假设第一个和第二个数之间是最大和第二大的数
	int max = 0;
	int max_two = 0;
	if (arr[0] > arr[1])
	{
		max = arr[0];
		max_two = arr[1];
	}
	else
	{
		max = arr[1];
		max_two = arr[0];
	}
	//遍历找出第二大的值
	for (int i = 2; i < sz; i++)
	{
		if (arr[i] > max)
		{
			int temp = max;
			max = arr[i];
			max_two = temp;
		}
		else if (arr[i] > max_two && arr[i] < max)
		{
			max_two = arr[i];
		}
	}
	return max_two;
}
int main()
{
	int arr[10] = { 88,996,55,2245,7548,666,444,2215,987,3654 };
	int sz = sizeof(arr) / sizeof(arr[0]);
	int value=Findarr(arr, sz);
	printf("第二大的值是：%d\n", value);
	return 0;
}