#include<stdio.h>
typedef struct{
int elem[50] ;
int length;
}SSTable;
int Search_Seq(SSTable ST,int key)
{
int i,x=0;
ST.elem[0]=key;
for(i=ST.length;ST.elem[i]!=key;--i)x++;
printf(" %d β ѯ!",x);������ � �
return i;
}//Search_Seq
int Search_Bin(SSTable ST,int key)
{
int low,high,mid;
int con=0;
low=1;
high=ST.length;
while(low<=high)
{
con++;
mid=(low+high)/2;
if(ST.elem[mid]==key)
{
printf(" %d ѯ!",con);������ ��
return mid;
}
else if(ST.elem[mid]>key)
high=mid-1;
else low=mid+1;
}
return 0;
}//Search_Bin
int main()
{
SSTable SST;
int key;
int i,x,y;
printf(" ұ ij :");�������� � ���
scanf("%d",&SST.length);
printf(" ұ е :");�������� �� ����
for(i=1;i<=SST.length;i++)
{
scanf("%d",&SST.elem[i]);
}
printf(" Ҫ ѯ :");������ �� �����
scanf("%d",&key);
x=Search_Seq(SST,key);
if(x==0)
printf("˳ ѯʱû !");��� ��������
else
printf("˳ ѯ ǵ %d !",x);��� ���� � �����
y=Search_Bin(SST,key);
if(y==0)
printf("�۰��ѯû !");��������
else
printf("�۰��ѯ ǵ %d !",y);���� � �����
return 0;
}