杨氏查找矩阵

#include<iostream>
using namespace std;
#define COL 3
#define ROW 3

bool Young(int a[][COL],int search){
int i =0,j = COL-1;
int tmp = a[i][j];
while (true){
if(tmp==search){
cout<<"a["<<i<<"]["<<j<<"]";
return true;
}
else if(tmp > search && j>0)
tmp = a[i][--j];
else if(tmp < search && i<ROW -1)
tmp = a[++i][j];
else
return false;
}
}

int main(){
int a[ROW][COL]={{1,2,3},{4,5,7},{6,8,9}};

cout<<Young(a,2);

system("pause");
return 0;

}