顺序查找算法代码:
voidmain()
{ inta[11]={0,72,90,25,60,30,70,80,19,20,35},i,x;
printf("Inputthedatayouwanttoseek:");scanf("%d",&x);
a[0]=x;
for(i=10;i>=0;i--) if(a[i]==x)break;//比较成功,退出循环
if(i==0)
printf("%ddoesn'texist!%d",x,i);
else
printf("%dexists!%d",x,i);
}