菜鸡笔记之——顺序查找
顺序查找:
待查找数据与数据组的元素一一比较,找得到输出该数的位置,找不到输出错误提示信息,顺序查找比较简单,但执行效率不高。
代码实现(顺序查找):
# include <stdio.h>
int main(void)
{
int a[100];
int N,i,search_number;
printf("the number of the array(less than 100):");
scanf("%d",&N);
for (i = 0;i<N;i++)
{
scanf("%d",&a[i]);
}
printf("enter the search_number:");
scanf("%d",&search_number);
//sequential seach
for (i = 0;i<N;i++)
{
if (a[i]==search_number)
{
printf("number %d is in the %dth place\n",search_number,i+1);
break;
}
}
if (i==N)
{
printf("can not find this number!\n");
}
return 0;
}