C++ 查找实验

#include <stdio.h>
#include <stdlib.h>
#define  KEYTYPE    int
#define  MAXSIZE    100
typedef  struct
{
      KEYTYPE  key;
}SSELEMENT;


typedef  struct
{
    SSELEMENT  r[MAXSIZE];//数据元素存储空间
    int   len;//长度
}SSTABLE;


int seq_search(SSTABLE  st,KEYTYPE k)
{/*表上顺序查找元素*/
   int i;
   st.r[0].key=k;
   for(i=st.len;i>0;--i)
   {
       if(st.r[0].key==st.r[i].key)
       {
        break;
       }
   }
       return i;
}


int bin_search(SSTABLE  st,KEYTYPE k)/*表上折半查找元素*/
{
   int low=1;
   int high=st.len;
   st.r[0].key=k;
   while(low<=high)
   {
        int mid=(low+high)/2;
        if(st.r[0].key==st.r[mid].key)
        return mid;
        if(st.r[mid].key<k)
            low=mid+1;
        else
           high=mid-1;
   }
   return 0;
}

int main( )
{
 SSTABLE  a;   int  i, j, k,n;
 printf("请输入顺序表元素(整型量)，用空格分开，-99为结束标志 ：\n");
 //printf("please input the int elements and separate by space. -99 is the end\n ");
j = 0;  k = 1;  i = 0;
scanf("%d",&i);
while (i != -99)
{ j++;
a.r[k].key = i;
 k++;
scanf("%d",&i);
}/*输入顺序表元素*/
a.len = j;


printf("\n顺序表元素列表显示 ：");
//printf("the elements are:");
for (i = 1; i<=a.len; i++)
printf("%d ",a.r[i].key); printf("\n");


printf("please input the key that you want to find:\n");
scanf("%d",&i);


printf("顺序查找\n");
n = seq_search(a,i);
if (n == 0)
printf("表中待查元素不存在\n\n"); 
else
printf("the element is at %d\n",n );


printf("折半查找\n");
k=bin_search(a,i);
if (k == 0)
printf("表中待查元素不存在\n\n");
//printf("there is not the element");
else
printf("the element is at %d\n",k );
//printf("please input the key that you want to find:\n");
//scanf("%d",&i);
//getchar();
return 0;
}