顺序查找

 

//SequentialSearch 顺序查找
#include <stdio.h>
#define N 9
int SequentialSearch(int search[], int k);

int main()
{
    int i,j,n;
    int k;
    int search[N] = {9,8,7,6,5,4,3,2,1};
    for (i = 0; i < N; i++)
    {
        printf("%d ",search[i]);
    }
    printf("\n\n");
    printf("请输入你所要查找的值：");
    scanf("%d",&k);
    
    n = SequentialSearch(search, k);
    
    if (n < 0)
    {
        printf("\n你查找的数据不存在\n");
    }
    else
    {
        printf("\n你查找的数据%d在第%d个\n",k,n+1);
    }

    printf("\n");
    return 0;
}

int SequentialSearch(int search[], int k)
{
    search[N] = k;
    int i = 0;
   // printf("%d",search[i]);
    while(search[i] != k)
    {
       i++;
    }
    if(i < N)
      return i;
    else
      return -1;
}

程序都经过调试，都是可以执行的