wex7_3.cpp

来自「数据结构C++代码,经典代码,受益多多,希望大家多多支持」· C++ 代码 · 共 37 行

#include <iostream.h>

// return the index of the maximum value in the array
template <class T>
int Max(T Arr[], int n)
{
	// assume initially that the maximum is at index 0
	T currMax = Arr[0];		// assume n > 0
	int currMaxIndex = 0;
	
	// cycle through the list, updating the maximum and
	// the index of the maximum
	for (int i = 1; i < n; i++)
		if (currMax < Arr[i])
		{
			currMax = Arr[i];
			currMaxIndex = i;
		}

	return currMaxIndex;
}

void main (void)
{
	int A[5] = {8, 3, 2, 9, 4};
	char name[] = "maximum";
	
	cout << "Max index for list 8, 3, 2, 9, 4 is " << Max(A,5) << endl;
	cout << "Max index for string 'maximum' is " << Max(name,7) << endl;
}
	
/*
<RUN>
Max index for list 8, 3, 2, 9, 4 is 3
Max index for string 'maximum' is 2
*/