数组有意思,我喜欢

#include<stdio.h>
#define SIZE 100
int linearSearch (int [],int,int);
 main()
 {
   int a[SIZE],x,searchKey,element;
   for(x=0;x<=SIZE-1;x++)
     a[x]=2*x;

     printf("Enter integer  secarch key:/n");
     scanf("%d",&searchKey);
     element=linearSearch(a,searchKey,SIZE);

     if( element!=-1)
 printf("Found value in element %d/n",element);
     else
 printf("Value not found/n");
     return 0;
 }
 int linearSearch(int array[],int key,int size)
 {
   int n;

   for (n=0;n<=size-1;n++)
    if(array[n]==key)
    return n;
    return -1;
 } 

调试是解决疑问的最好的方法.加油!