杨氏矩阵

最新推荐文章于 2024-05-31 04:49:18 发布

wangyan_0804

最新推荐文章于 2024-05-31 04:49:18 发布

阅读量211

点赞数

分类专栏：【学习小记】文章标签： search include input

本文链接：https://blog.csdn.net/wangyan_0804/article/details/7875891

版权

【学习小记】专栏收录该内容

19 篇文章 0 订阅

订阅专栏

#include <stdio.h>
#define ROW 4
#define COL 4

int youngSearch(int * YOUNG, int search);

void main()
{
int young[][COL] = {{1,4,5,9},{3,7,8,10},{4,8,9,11},{6,9,11,13}};
int search;
printf("input the search num. \n");
scanf("%d",&search);
if(youngSearch(young, search))
  printf("%d is in youngMatrix.",search);
else
  printf("%d is not in youngMatrix.",search);
}
int youngSearch(int * YOUNG, int search)
{
int funROW = 0;
int funCOL = COL -1;
int i = 0;
int value = * ( YOUNG + funROW * ROW + funCOL);
for(;i<ROW+COL;i++)
{
  if(search == value)
   return 1;
  else if((value > search) && (funCOL > 0))
   value = * ( YOUNG + funROW * ROW + (--funCOL));
  else if((value < search) && (funROW < ROW - 1))
   value = * ( YOUNG + (++funROW) * ROW + funCOL);
  else
   return 0;
}
}