下载文档到电脑,查找使用更方便
20金贝
下载
第一章5:#include using namespace std;int main(){ cout<<"This"<<"is"; cout<<"a"<<"C++"; cout<<"program."<using namespace std;int main(){ int a,b,c; a=10; b=23; c=a+b; cout<<"a+b="; cout<using namespace std;int main(){ int a,b,c; int f(int x,int y,int z); cin>>a>>b>>c; c=f(a,b,c); cout<using namespace std;int main(){ int a,b,c; cin>>a>>b; c=a+b; cout<<"a+b="<using namespace std;int main(){int add(int x,int y); int a,b,c; cin>>a>>b; c=add(a,b); cout<<"a+b="<using namespace std;int main(){void sort(int x,int y,int z);int x,y,z; cin>>x>>y>>z; sort(x,y,z); return 0;}void sort(int x, int y, int z){ int temp; if (x>y) {temp=x;x=y;y=temp;} //{ }内3个语句的作用是将x和y的值互换) if (zusing namespace std;int main(){int max(int a,int b,int c=0); int a,b,c; cin>>a>>b>>c; cout<<"max(a,b,c)="<a) a=b; if(c>a) a=c; return a;}12:#include using namespace std;int main(){ void change(int ,int ); int a,b; cin>>a>>b; if(a>a>>b>>c; a1=a;b1=b;c1=c; sort(a1,b1,c1); cout<j) change(i,j); if (i>k) change(i,k); if (j>k) change(j,k);}void change(int &x,int &y){ int temp; temp=x; x=y; y=temp;}14:#include #include using namespace std;int main(){ string s1="week",s2="end"; cout<<"s1="<#include using namespace std;int main(){ string str; int i,n; char temp; cout<<"please input a string:"; cin>>str; n=str.size(); for(i=0;i#include using namespace std;int main(){ int i; string str[5]={"BASIC","C","FORTRAN","C++","PASCAL"}; void sort(string []); sort(str); cout<<"the sorted strings :"<s[i+1]) {t=s[i];s[i]=s[i+1];s[i+1]=t;} }17: #include #include using namespace std;int main(){ long c[5]={10100,-123567, 1198783,-165654, 3456}; int a[5]={1,9,0,23,-45}; float b[5]={2.4, 7.6, 5.5, 6.6, -2.3 }; void sort(int []);void sort(float []); void sort(long []); sort(a); sort(b); sort(c); return 0;}void sort(int a[]){int i,j,t; for (j=0;j<5;j++) for(i=0;i<5-j;i++) if (a[i]>a[i+1]) {t=a[i];a[i]=a[i+1];a[i+1]=t;} cout<<"the sorted numbers :"<a[i+1]) {t=a[i];a[i]=a[i+1];a[i+1]=t;} cout<<"the sorted numbers :"<a[i+1]) {t=a[i];a[i]=a[i+1];a[i+1]=t;} cout<<"the sorted numbers :"<#include using namespace std;template void sort(T a[]) {int i,j,min; T t; for(i=0;i<5;i++) {min=i; for (j=i+1;j<5;j++) if(a[min]>a[j]) min=j; t=a[i]; a[i]=a[min]; a[min]=t; } cout<<"the sorted numbers :"<