C语言查找结构——用主函数链接上面的4个函数，做一个查找成功和一个查找失败的测试

#define MaxSize 100
typedef struct {
int data[MaxSize];
int length;
}LineSearch;

void InitLineSearch(LineSearch &s,int a[], int n)
{
for (int i = 0; i < n; i++)
s.data[i+1] = a[i];
s.length = n;
}

int Locate_LineSearch(LineSearch s,int k){
for(int i=1;i<=s.length;i++){
if(s.data[i]==k){
return i;
}
}
return 0;
}

int LineSearch_SeqSearch1(LineSearch s,int k)
{
int i = s.length;
while (i > 0 && s.data[i] != k)
i--;
return i;
}

int LineSearch_SeqSearch2(LineSearch s,int k)
{
int i = s.length; s.data[0] = k;
while (s.data[i] != k)
i--;
return i;
}

用主函数链接上面的4个函数，做一个查找成功和一个查找失败的测试
用主函数链接上面的4个函数，做一个查找成功和一个查找失败的测试
用主函数链接上面的4个函数，做一个查找成功和一个查找失败的测试

供参考：

#include <stdio.h>
#define MaxSize 100
typedef struct {
    int data[MaxSize];
    int length;
}LineSearch;

void InitLineSearch(LineSearch &s,int a[], int n)
{
    for (int i = 0; i < n; i++)
        s.data[i+1] = a[i];
    s.length = n;
}

int Locate_LineSearch(LineSearch s,int k){
    for(int i=1;i<=s.length;i++){
       if(s.data[i]==k){
          return i;
       }
    }
    return 0;
}

int LineSearch_SeqSearch1(LineSearch s,int k)
{
    int i = s.length;
    while (i > 0 && s.data[i] != k)
          i--;
    return i;
}

int LineSearch_SeqSearch2(LineSearch s,int k)
{
    int i = s.length; s.data[0] = k;
    while (s.data[i] != k)
          i--;
    return i;
}
int main()
{
    LineSearch s;
    int a[10]={1,3,7,9,11,13,15,17,19,21}, n;
    InitLineSearch(s,a,10);

    n = Locate_LineSearch(s,13);
    if (n == 0)
        printf("Not Found!\n");
    else
        printf("Found:%d\n",s.data[n]);

    n = LineSearch_SeqSearch1(s,4);
    if (n == 0)
        printf("Not Found!\n");
    else
        printf("Found:%d\n",s.data[n]);

    n = LineSearch_SeqSearch2(s,4);
    if (n == 0)
        printf("Not Found!\n");
    else
        printf("Found:%d\n",s.data[n]);

    return 0;
}