int SqSerch(SQLIST L,int aidkey)
{int j;
for(j=0;j<L.len;j++)
if (L.elem[j].key==aidkey) return j;
return -1;
}
这是一个线性查找的算法
有位高手帮我写了个程序
但有错误啊


#include<stdio.h>
#define MaxSize 100
typedef struct
{
int list[MaxSize];
int len;
}SQLIST;

int SqSerch(SQLIST L,int aidkey)
{int j;
for(j=0;j<L.len;j++)
if (L.elem[j].key==aidkey) return j;
return -1;
}

void main()
{
SQLIST list={{100,200,90,400,300,80,10},7};
int x=90;
int i;
if((i=SqSerch(list,x))!=-1)
printf("该数据元素的位置为%d",i);
printf("查找失败!");
}

程序代码：

#include<stdio.h>

typedef struct
{
    int key;
}type;
#define MaxSize 100
typedef struct
{
   type list[MaxSize];
   int len;
}SQLIST;


int SqSerch(SQLIST L,type aidkey)
{int j;
   for(j=0;j<L.len;j++)
       if (L.list[j].key==aidkey.key) return j;
            return  -1;
}
void main()
{
  SQLIST list={{100,200,90,400,300,80,10},7};
  type x={90};
  int i;
  if((i=SqSerch(list,x))!=-1)
    printf(\"该数据元素的位置为%d\n\",i);
  else
      printf(\"查找失败!\");
}

谢谢了啊！