#include "pch.h"
#include <iostream>
using namespace std;
int * max(int ar[], int);
int * min(int ar[], int);
int main()
{
const int number = 9;
int a[number];
for (int i = 0; i < number; i++)
{
cout << "Enter you number" << i + 1 << ": \n";
cin >> a[i];
}
int * p1;
p1 = a; //声明指针指向a[0]
int * max_num; //声明指针调用函数
max_num = max(a, number);
int * min_num;
min_num = min(a, number);
int whatever;
whatever = rand() % 8+0;
cout << "max number: " << *max_num << " " <<"another numbers: "<< *(p1+whatever) << " "; //调用指针
whatever = rand() % 8 + 0;
cout << *(p1+whatever);
cout << endl;
whatever = rand() % 8 + 0;
cout << "min number: " << *min_num << " " << "another numbers: " << *(p1 + whatever) << " ";
whatever = rand() % 8 + 0;
cout << *(p1 + whatever);
return 0;
}
int * max(int ar[], int n)
{
int * max_number = &ar[0];
for (int i = 1; i < n; i++)
{
if (*(ar+i) >* max_number)
max_number = &ar[i];
}
return max_number;
}
int * min(int ar[], int n)
{
int * min_number = &ar[0];
for (int i = 1; i < n; i++)
{
if (*(ar+i) < *min_number)
min_number = &ar[i];
}
return min_number;
}
#include <iostream>
using namespace std;
int * max(int ar[], int);
int * min(int ar[], int);
int main()
{
const int number = 9;
int a[number];
for (int i = 0; i < number; i++)
{
cout << "Enter you number" << i + 1 << ": \n";
cin >> a[i];
}
int * p1;
p1 = a; //声明指针指向a[0]
int * max_num; //声明指针调用函数
max_num = max(a, number);
int * min_num;
min_num = min(a, number);
int whatever;
whatever = rand() % 8+0;
cout << "max number: " << *max_num << " " <<"another numbers: "<< *(p1+whatever) << " "; //调用指针
whatever = rand() % 8 + 0;
cout << *(p1+whatever);
cout << endl;
whatever = rand() % 8 + 0;
cout << "min number: " << *min_num << " " << "another numbers: " << *(p1 + whatever) << " ";
whatever = rand() % 8 + 0;
cout << *(p1 + whatever);
return 0;
}
int * max(int ar[], int n)
{
int * max_number = &ar[0];
for (int i = 1; i < n; i++)
{
if (*(ar+i) >* max_number)
max_number = &ar[i];
}
return max_number;
}
int * min(int ar[], int n)
{
int * min_number = &ar[0];
for (int i = 1; i < n; i++)
{
if (*(ar+i) < *min_number)
min_number = &ar[i];
}
return min_number;
}