查找算法

#include <stdio.h>
#define N 40
int ReadScore(int score[],long num[]);
int LinSearch(long num[],long x,int n);
int main()
{
    int score[N],n,pos;
    long num[N],x;
    n = ReadScore(score,num);
    printf("Total students are %d\n",n);
    printf("Input the search ID:");
    scanf("%ld",&x);
    pos = LinSearch(num,x,n);
    if (pos!=-1)
    {
        printf("score = %d\n", score[pos]);
        /* code */
    }

    else printf("Not found!\n");
    return 0;
}
int ReadScore(int score[],long num[])
{
    int i=-1;
    do{
        i++;
        printf("Input student Id and score:\n");
        scanf("%ld%d",&num[i],&score[i]);
    }while(num[i]>0&&score[i]>=0);
    return i;
}
int LinSearch(long num[],long x,int n)
{
    for (int i = 0; i < n; ++i)
    {
        if (x==num[i])
        {
            return i;
            /* code */
        }
        /* code */
    }
    return -1;
}