数据结构: 顺序查找

有哨兵顺序查找

意思就是将数组a[0]存下要查找的数，从数组的尾巴开始查找，若顺序查找函数返回的是非0值就代表查找成功，否则查找失败。

#include<stdio.h>
int Sequence_search(int *a,int n, int key);

int main()
{
    int a[10];
    int i = 1;
    int key = 0;
    int n = 0;
    int return_number;
    printf("Please Enter how many you want to input numbers！\n");
    scanf("%d", &n);
    printf("Please Enter %d numbers!\n", n);
    for(; i <= n; i++)
    {
        scanf("%d", &a[i]);
    }
    printf("Please Input the search number!\n");
    scanf("%d", &key);
    return_number = Sequence_search(a, n, key);
    if(return_number != 0)
    {
        printf("查找成功!\n");
        printf("查找的数的位序是%d\n", return_number);
    }
    else
    {
        printf("查找失败,未找到该数!\n");
    }


}

int Sequence_search(int *a, int n, int key)
{
    a[0] = key;
    int i = n;
    for(; i >= 0; i--)
    {
        if(a[i] == key)
        {
            return i;
        }
    }
    return 0;

}