查找.c

数据结构源程序集,里面包含一些经典的算法源程序

/*cha zaho*/
#include<stdio.h>
#define maxlen 100
int creat(v,n)
int v[],n;
{int i;
 printf("\n CREAT LIST!\n");
 for(i=1;i<=n;i++) scanf("%d",&v[i]);
 printf("\n OUTPUT LIST!\n");
 for(i=1;i<=n;i++) printf("v[%d]=%d ",i,v[i]);
 printf("\n");
 }

 int insearch(v,n)
 int v[],n;
 { int i,k;
   printf("\n INSERCH!\n");
   printf("\n Please input k: ");
   scanf("%d",&k);
   v[n+1]=k;
   i=1;
   while(v[i]!=k) i++;
   if(i<=n){printf(" FOUND! i=%d ",i);
			printf("v[%d]=%d ",i,v[i]);}
	else	printf("\n NOT FOUND!\n");
   printf("\n");
   }

   main()
   { int v[maxlen],n,i;
	 printf("\n please input len: ");
	 scanf("%d",&n);
	 i=1;
	 while(i)
	 {printf("\n 1:CREAT LIST!");
	  printf("\n 2:LIST SEARCH!");
	  printf("\n 0:EXIT!");
	  printf("\n Please input i: ");
	  scanf("%d",&i);
	  switch(i)
	  {case 1:creat (v,n);break;
	  case 2:insearch(v,n);break;
	  }
	 }
   }