小沈的C++学习8——引用

int a=1;
int &b=a;
cout<endl;
a = 2;
cout<endl;
b = 1;
cout<

int a=1;
int &b=a;
cout<<&a<<endl;
cout<<&b<

#include
using namespace std;
void swap(int *x,int *y)
{
int temp=*x;
*x=*y;
*y=temp;
}
int main(){
int x=1,y=2;
swap(&x,&y);
cout<<"x="<endl;
cout<<"y="<endl;
}

#include
using namespace std;
void swap(int &x,int &y)
{
int temp=x;
x=y;
y=temp;
}
int main(){
int x=1,y=2;
swap(x,y);
cout<<"x="<endl;
cout<<"y="<endl;
}

#include
using namespace std;
int max(int a,int b)
{
if(a>b)
{
return a;
}
return b;
}
int min(int a,int b)
{
if(a<b)
{
return a;
}
return b;
}//比较
void findst(int *p,int h,int l,int (*func)(int,int),int &res,int &y,int &x)
{
res=*p;
int num=0;
for(int i=1;i){
int bak = func(res,p[i]);
if(res!=bak){
res = bak;
num=i;
}
}
y=num/l+1;
x=num%l+1;
return;
}//“打擂台”
int main()
{
/*矩阵实战*/
int d[3][4]={{1,2,3,4},{4,5,6,7},{7,8,9,10}};
int *p=&d[0][0];
int res,x,y;
findst(p,3,4,max,res,y,x);
cout<<"最大的数是"<"\n它在第"<"行第"<"个"<<endl;
findst(p,3,4,min,res,y,x);
cout<<"最小的数是"<"\n它在第"<"行第"<"个";
}