//线性查找
//将第0个元素,做为防止越界的标记
//从后往前查
typedef struct
{
int num;
}student;
typedef struct
{
int length;
student st[MAX+1];
}student_t;
int search1(student_t st,int flag)
{
int i = st.length;
st.st[0].num = flag;
while (st.st[i].num!=flag)
{
i--;
}
return i;
}
int main(void)
{
student_t st = {5,0,95,6,3,54,65};
printf("%d\n",search1(st,95));
return 0;
}
线性查找
最新推荐文章于 2022-04-24 17:18:27 发布