#include<iostream>
using namespace std;
int *max(int *,int *,int *,int *);
void main()
{
int c1[5]={1,5,6,9,8};
int c2[8]={9,13,54,6,8,32,16,78};
int n;
int m;
int *p;
p = max(c1,c2,&n,&m);
cout<<"最大值是:"<<*p<<endl;
cout<<"在第"<<m<<"个数组中"<<endl;
cout<<"位置是"<<n+1<<endl;
}
int *max(int* c1,int* c2,int* n,int* m)
{
int i = 0;
int * mx = &c1[0];
while (i<5)
{
if (*mx<c1[i])
{
*mx = c1[i];
*n = i;
*m = 1;
}
i++;
}
while (i<8)
{
if (*mx<c2[i])
{
*mx = c2[i];
*n = i;
*m = 2;
}
i++;
}
return mx;
}
using namespace std;
int *max(int *,int *,int *,int *);
void main()
{
int c1[5]={1,5,6,9,8};
int c2[8]={9,13,54,6,8,32,16,78};
int n;
int m;
int *p;
p = max(c1,c2,&n,&m);
cout<<"最大值是:"<<*p<<endl;
cout<<"在第"<<m<<"个数组中"<<endl;
cout<<"位置是"<<n+1<<endl;
}
int *max(int* c1,int* c2,int* n,int* m)
{
int i = 0;
int * mx = &c1[0];
while (i<5)
{
if (*mx<c1[i])
{
*mx = c1[i];
*n = i;
*m = 1;
}
i++;
}
while (i<8)
{
if (*mx<c2[i])
{
*mx = c2[i];
*n = i;
*m = 2;
}
i++;
}
return mx;
}