C语言杨氏矩阵

int Yang_arr(int arr[3][3], int k, int* row, int* col)
{
	int x = 0;
	int y = *col - 1;//右上角的坐标
	while (x<=*row-1 && y>=0)//左下角坐标,右上角坐标不断的while循环寻找的同时不能超出左下标,
	{
		if (arr[x][y] > k)
		{
			y--;
		}
		else if (arr[x][y] < k)
		{
			x++;
		}
		else
		{
			*row = x;
			*col = y;
			return 1;
		}
	}
}
int main()
{
	int x = 3, y = 3, k = 0;
	int arr[3][3] = { {1,2,3},{4,5,6},{7,8,9} };
	printf("请输入你要查找的数值\n");
	scanf("%d", &k);
	int ret = Yang_arr(arr, k, &x, &y);
	if (ret == 1)
	{
		printf("找到了,下标为%d %d", x, y);
	}
	else 
	{
		printf("找不到");
	}
	return 0;
}