线性查找法

#include <stdio.h>
#include <stdlib.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 searching ID:");
    scanf("%ld", &x);
    pos = LinSearch(num, x, n);
    if (pos != -1)
        printf("Score = %d\n", score[pos]);
    else
        printf("Not found!\n");
    return 0;
}

int ReadScore(int score[], long num[])
{
    int i = -1;
    do{
        i++;
        printf("Input student's ID and score:");
        scanf("%ld%d", &num[i], &score[i]);
    }while (num[i] > 0 && score[i] >= 0);
    return i;
}

//线性查找法查找值为x的数组元素，若找到则返回x在数组中的下标位置
int LinSearch(long num[], long x, int n)
{
    int i;
    for (i = 0; i < n; i++)
        if(num[i] == x)
            return i;
    return -1;
}