//暴力解法
//杨氏数组
// 1 3 5 7
// 2 4 6 8
// 3 5 7 9
// 7 8 9 10
#include <stdio.h>
#include <stdbool.h>
#define ROW 5
#define COL 5
bool FindNum(int ar[ROW][COL], int key)
{
//O(N^2)
for (int i = 0; i < ROW; i++)
{
for (int j = 0; j < COL; j++)
{
if (ar[i][j] == key)
return true;
}
}
return false;
}
int main()
{
int ar[ROW][COL] = {
{ 1, 3, 5, 7, 9, },
{ 2, 4, 6, 8, 10 },
{ 11, 13, 15, 17, 19 },
{ 21, 23, 25, 27, 29 },
{ 31, 33, 35, 37, 39 }
};
int key = 23;
bool flag = FindNum(ar, key);
if (flag)
{
printf("key%d found.\n", key);
}
else
printf("key%d not found.\n",key);
return 0;
}
04-08
398
09-05
6089