Question

编写c++函数 求整型数组中的最大数和最小数

Answer 1

#include<iostream>
using namespace std;
int GetMaxNum(int arr[],int n)//最大值函数
{
int result=arr[0];
for(int i=1;i<n;i++)
{
if(result<arr[i])
{
result=arr[i];
}
}
return result;
}
int GetMinNum(int arr[],int n)//最小值函数
{
int result=arr[0];
for(int i=1;i<n;i++)
{
if(result>arr[i])
{
result=arr[i];
}
}
return result;
}
void main(void)
{
int a[10]={1,5,7,22,-5,1,3,9,21};
cout<<"数组a中最小的数是:"<<GetMaxNum(a,10)<<endl;
cout<<"数组a中最小的数是:"<<GetMinNum(a,10)<<endl;
cin.get();
}

Answer 2

#include<iostream>
using
namespace
std;
int
GetMaxNum(int
arr[],int
n)//最大值函数
{
int
result=arr[0];
for(int
i=1;i<n;i++)
{
if(result<arr[i])
{
result=arr[i];
}
}
return
result;
}
int
GetMinNum(int
arr[],int
n)//最小值函数
{
int
result=arr[0];
for(int
i=1;i<n;i++)
{
if(result>arr[i])
{
result=arr[i];
}
}
return
result;
}
void
main(void)
{
int
a[10]={1,5,7,22,-5,1,3,9,21};
cout<<"数组a中最小的数是:"<<GetMaxNum(a,10)<<endl;
cout<<"数组a中最小的数是:"<<GetMinNum(a,10)<<endl;
cin.get();
}

Answer 3

#define N 10
static int array[N];
int init_arry(const int begin , const int end)
{
int i;
srand(time(NULL));
for (i=begin; i <end; i++) array[i] = rand() % 100;
}
int max_num(const int begin, const int end)
{
int i;
int max = a[begin];
for (i=begin; i < end; i++)
if (max < a[i])
max = a[i];
return max;
}
int min_num(const int begin, const int end)
{
int i;
int min = a[begin];
for (i=begin; i < end; i++)
if (min > a[i])
min = a[i];
}
int print_array(const int begin, const int end)
{
int i;
for (i=begin; i < end; i++) cout << array[i];

}
int main(void)
{
init_array(0, N-1);
print_array(0, N-1);
cout <<min_num(0, N-1);
count <<max_num(0, N-1);
return 0;
}

Answer 4

#include <iostream>
using namespace std;

void main(){
int d[10];
int max;
int min;
cin>>d[0];
max=d[0];
min=d[0];
for(int i=1;i<10;i++){
cin>>d[i];
if(d[i]>max)
max=d[i];
if(d[i]<min)
min=d[i];
}
cout<<"max="<<max<<"min="<<min<<endl;
}