4-3.cpp

为初学者提供的最佳的C++程序设计源程序库

#include<iostream.h>
#include<iomanip.h>
int findmax(int Iarg[]);
float findmax(float Farg[]);
double findmax(double Darg[]);
int findmin(int Iarg[]);
float findmin(float Farg[]);
double findmin(double Darg[]);
main()
{
  int Iarg[10]={15,88,34,12,31,10,9,3,5,7};
  float Farg[10]={145.5,32.3,363.2,19.3,70.1,35.4,51.2,53.7,39.4,59.2};
  double Darg[10]={15.54323,2.47763,63.29876,19.67863,78.34541,				   35.44009,51.20392,53.40967,39.80604,59.11112};
  cout<<"largest value in the Iarg is "<<(findmax(Iarg))<<"\n";
  cout<<"largest value in the Farg is "<<(findmax(Farg))<<"\n";
  cout<<"largest value in the Darg is "<<(findmax(Darg))<<"\n";
  cout<<"smallest value in the Iarg is "<<(findmin(Iarg))<<"\n";
  cout<<"smallest value in the Farg is "<<(findmin(Farg))<<"\n";
  cout<<"smallest value in the Darg is "<<(findmin(Darg))<<"\n";
  return 0;
}
//以下是重载函数findmax()和findmin()
int findmax(int Iarg[])
{
   int max=0;
   for(int i=0;i<10;i++)
   {
     if(Iarg[i]>max)
	 {
	   max=Iarg[i];
	 }
	}
return max;
}
float findmax(float Farg[])
{
   float max=0;
   for(int i=0;i<10;i++)
   {
     if(Farg[i]>max)
	 {
	   max=Farg[i];
	 }
	}
return max;
}
double findmax(double Darg[])
{
   double max=0;
   for(int i=0;i<10;i++)
   {
     if(Darg[i]>max)
	 {
	   max=Darg[i];
	 }
	}
return max;
}
int findmin(int Iarg[])
{
   int min=999;
   for(int i=0;i<10;i++)
   {
     if(Iarg[i]<min)
	 {
	   min=Iarg[i];
	 }
	}
return min;
}
float findmin(float Farg[])
{
   float min=9999.9;
   for(int i=0;i<10;i++)
   {
     if(Farg[i]<min)
	 {
	   min=Farg[i];
	 }
	}
return min;
}
double findmin(double Darg[])
{
   double min=9999.9;
   for(int i=0;i<10;i++)
   {
     if(Darg[i]<min)
	 {
	   min=Darg[i];
	 }
	}
return min;
}