(1)顺序查找
#include <stdio.h>
int main()
{
int a[]={1,2,3,4,5,6,7,8,9,10};
int i=0;
int x=0;
int az=sizeof(a)/sizeof(a[0]);
for(i=0;i<az;i++)
{
if(x==a[i])
{
printf("下标是%d",i);
break;
}
}
if(i==az)
{
printf("没有");
}
return 0;
}
(2)二分查找
#include <stdio.h>
int main()
{
int x=0;
int a[]={1,2,3,4,5,6,7,8,9,10};
int lfet=0;
int az=sizeof(a)/sizeof(a[0]);
int right=az-1;
while(lfet<=right)
{
int mid=(lfet+right)/2;
if(a[mid]>x)
{
right=mid-1;
}
else if(a[mid]<x)
{
lfet=mid+1;
}
else if(a[mid]=x)
{
printf("%d",mid);
break;
}
}
if(lfet>right)
printf("无");
return 0;
}