線性查找

//線性查找
//將第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;
}