class.h

有数据结构的答案啊 有数据结构的答案啊

#include <iostream.h> class RecurveArray {					//数组类声明 private: 	int *Elements;					//数组指针 	int ArraySize;					//数组尺寸
int CurrentSize;					//当前已有数组元素个数 public :
			RecurveArray ( int MaxSize =10 ) :
ArraySize ( MaxSize ), Elements ( new int[MaxSize] ){ } ~RecurveArray ( ) { delete [ ] Elements; } void InputArray();				//输入数组的内容 int MaxKey ( int n );				//求最大值 int Sum ( int n );					//求数组元素之和
			float Average ( int n );				//求数组元素的平均值
};

void RecurveArray :: InputArray ( ){	//输入数组的内容
			cout << "Input the number of Array: \n";
			for ( int i = 0; i < ArraySize; i++ ) cin >> Elements[i];
}

int RecurveArray :: MaxKey ( int n ) {		//递归求最大值
			if ( n == 1 ) return Elements[0];
			int temp = MaxKey ( n - 1 );
			if ( Elements[n-1] > temp ) return Elements[n-1];
			else return temp;
}

int RecurveArray :: Sum ( int n ) {			//递归求数组之和
			if ( n == 1) return Elements[0];
			else return Elements[n-1] + Sum (n-1);
}

float RecurveArray :: Average ( int n ) {		//递归求数组的平均值
			if ( n == 1) return (float) Elements[0];
			else return ( (float) Elements[n-1] + ( n - 1) * Average ( n - 1 ) ) / n;
}

int main ( int argc,  char* argv [ ] ) { 	int size = -1;
			cout << "No. of the Elements : ";
			while ( size < 1 ) cin >> size;
			RecurveArray ra ( size );
			ra.InputArray();	
			cout<< "\nThe max is:  " << ra.MaxKey ( ra.MaxSize ) << endl;
			cout<< "\nThe sum is:  " << ra.Sum ( ra.MaxSize ) << endl;
			cout<< "\nthe avr is:  " << ra.Average ( ra.MaxSize ) << endl;
			return 0;
}