顺序查找.txt

数据结构课堂实验 集中了数据结构,线性表,连表,栈,队列,二叉树,图,排序算法,查找算法的实现

#include <stdio.h>
#include <alloc.h>
int Search_Sq(int a[],int n, int key)
{ int i;
  a[0]=key;
  for(i=n;a[i]!=key;i--);
  return i;
}

void CreatSearchTable(int a[],int n)
{ int i;
  printf("Input %d numbers:", n);
  for(i=1;i<=n;i++)
     scanf("%d",&a[i]);
}
main()
{ int a[30], key;
  int n,loc;
  n=11;
  CreatSearchTable(a,n);
  printf("Input a number to search:");
  scanf("%d",&key);
  loc=Search_Sq(a,n,key);
  if(loc) printf("%d is found!! Position is %d!!\n",key,loc);
  else printf("%d  is not found!!!\n",key);
}