基于visual Studio2013解决算法导论之016查找最大值最小值



题目

查找最大、最小值

解决代码及点评

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

void PrintArr(int *pnArr, int nLen)
{
	for (int i = 0; i < nLen; i++)
	{
		printf("%d ", pnArr[i]);
	}
	printf("\n");
}

int Min(int *pnArr, int nLen)
{
	int nMin = pnArr[0];
	for (int i = 1; i < nLen; i++)
	{
		if (nMin > pnArr[i])
		{
			nMin = pnArr[i];
		}
	}

	return nMin;
}

int Max(int *pnArr, int nLen)
{
	int nMax = pnArr[0];
	for (int i = 1; i < nLen; i++)
	{
		if (nMax < pnArr[i])
		{
			nMax = pnArr[i];
		}
	}

	return nMax;
}

void MaxMin(int *pnArr, int nLen, int *pnMax, int *pnMin)
{
	if (nLen % 2 == 0)
	{
		if (pnArr[0] > p