int search(int arr[3][3], int k,int* px,int* py )
{
int x = 0;
int y = *py - 1;
while (y >= 0 && x <*px-1 )
{
if (arr[x][y] > k)
{
y--;
}
else if (arr[x][y] < k)
{
x++;
}
else
{
*px = x;
*py = y;
return 1;
}
}
return 0;
}
int main()
{
int arr[3][3] = { {1,2,3},{4,5,6},{7,8,9} };
int k = 0;
int x = 3;
int y = 3;
scanf("%d", &k);
int ret=search(arr, k,&x,&y);
if (ret == 1)
{
printf("找到了\n");
printf("下标是%d %d\n", x, y);
}
else
{
printf("找不到\n");
}
return 0;
}
08-28
955
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
12-03
618
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
06-10