查找之顺序查找

  1 #include <stdio.h>                                       
  2 
  3 int data[8]={12,11,5,4,6,7,8,9};
  4 
  5 int seq_search(int keyvalue,int *i,int *counter)
  6 {
  7     *counter = 1;
  8 
  9 
 10     for(*i=0;*i<8;(*i)++)
 11     {
 12         if(keyvalue==data[*i])
 13             return 1;
 14         (*counter)++;/*必须加括号！*/
 15     }
 16     return 0;
 17 }
 18 
 19 int main (void)
 20 {
 21     int keyvalue;
 22     int a = 0;
 23     int b = 1;
 24     int *i = &a;/*如果不初始化指针就会发生野指针！*/
 25     int *counter = &b;/*注意野指针*/
 26 
 27     printf("data is :%d %d %d %d %d %d %d %d",data[0],data[1],data[2],data[3],data[4],data[5],data[6],data[7]);
 28     printf("\nPlease entr your key value:");
 29     scanf("%d",&keyvalue);
 30 
 31     if (seq_search(keyvalue,i,counter))
 32     {
 33         printf("\nlocation is:%d\n",(*i+1));
 34         printf("\nsearch time = %d\n",*counter);
 35 
 36     }
 37     else
 38         printf("no found");
 39 
 40     return 0;
 41 }

简单的顺序查找找到后就输出所在的位置和所用的时间.