8.15
来源:互联网 发布:dnf一进去就网络中断 编辑:程序博客网 时间:2024/05/19 08:45
#include<iostream>
using namespace std;
template <class T>
T max(T *A,int n)
{ int i,j=0;
for (i=1;i<n;i++)
if (A[i]>A[j])
{ j=i; }
return A[j];
}
template <class T>
T min(T *A,int n)
{ int i,j=0;
for (i=1;i<n;i++)
if (A[i]<A[j])
{ j=i; }
return A[j];
}
int main()
{ int A1[]={2,3,5,6,8,9,1,5,10,27};
double A2[]={12.1,23.1,34.2,13.3,132.4,1.3,34.2,46.2,13.4,18.3};
char A3[]={'a','d','r','e','t','f','g','w','v','z'};
cout<<"A1中最大的数为 :"<<endl;
cout<<max(A1,10)<<endl;
cout<<"A2中最大的数为 :"<<endl;
cout<<max(A2,10)<<endl;
cout<<"A3中最大的数为 :"<<endl;
cout<<max(A3,10)<<endl;
cout<<"A1中最小的数为 :"<<endl;
cout<<min(A1,10)<<endl;
cout<<"A2中最小的数为 :"<<endl;
cout<<min(A2,10)<<endl;
cout<<"A3中最小的数为 :"<<endl;
cout<<min(A3,10)<<endl;
system("pause");
return 0;
}
using namespace std;
template <class T>
T max(T *A,int n)
{ int i,j=0;
for (i=1;i<n;i++)
if (A[i]>A[j])
{ j=i; }
return A[j];
}
template <class T>
T min(T *A,int n)
{ int i,j=0;
for (i=1;i<n;i++)
if (A[i]<A[j])
{ j=i; }
return A[j];
}
int main()
{ int A1[]={2,3,5,6,8,9,1,5,10,27};
double A2[]={12.1,23.1,34.2,13.3,132.4,1.3,34.2,46.2,13.4,18.3};
char A3[]={'a','d','r','e','t','f','g','w','v','z'};
cout<<"A1中最大的数为 :"<<endl;
cout<<max(A1,10)<<endl;
cout<<"A2中最大的数为 :"<<endl;
cout<<max(A2,10)<<endl;
cout<<"A3中最大的数为 :"<<endl;
cout<<max(A3,10)<<endl;
cout<<"A1中最小的数为 :"<<endl;
cout<<min(A1,10)<<endl;
cout<<"A2中最小的数为 :"<<endl;
cout<<min(A2,10)<<endl;
cout<<"A3中最小的数为 :"<<endl;
cout<<min(A3,10)<<endl;
system("pause");
return 0;
}
0 0
- 8.15
- 8.15
- 8.15
- 8.15
- 习题8.15
- 8.15模拟
- 8.15作业
- 8.14~8.15
- 作业8.15
- 8.15总结
- 8.15 练习
- 8.8~8.15
- 8.15总结
- 8.15 A
- 8.15 B
- 8.15 C
- 8.15 D
- 8.15 E
- 如何使用VS 2013发布一个可以在Windows XP中独立运行的可执行文件
- android 滑动的开关按钮
- GitHub搭博客
- NSString - 总结
- matlab 输入一个字符串,写入到图像中, 并可读出
- 8.15
- JSR-303 Spring MVC 消息国际化 配置
- Java中equals()与hashCode()方法详解
- 每日感悟,更新...... 2015.6.4
- Hadoop作业优先级控制
- LuaSocket
- Linux 的常见命令
- Lua 的模块安装和部署工具 - LuaRocks
- Project Euler:Problem 11 Largest product in a grid