点击这里

这里我们介绍C语言中线性搜索的实现。 程序的输出在代码之后给出。

线性搜索程序

#include <stdio.h>
#define MAX 20
// array of items on which linear search will be conducted.
int intArray[MAX] = {1,2,3,4,6,7,9,11,12,14,15,16,17,19,33,34,43,45,55,66};
void printline(int count) {
   int i;
   for(i = 0;i <count-1;i++) {
      printf("=");
   }
   printf("=\n");
}
// this method makes a linear search. 
int find(int data) {
   int comparisons = 0;
   int index = -1;
   int i;
   // navigate through all items 
   for(i = 0;i<MAX;i++) {
      // count the comparisons made 
      comparisons++;
      // if data found, break the loop
      if(data == intArray[i]) {
         index = i;
         break;
      }
   }   
   printf("Total comparisons made: %d", comparisons);
   return index;
}
void display() {
   int i;
   printf("[");
   // navigate through all items 
   for(i = 0;i<MAX;i++) {
      printf("%d ",intArray[i]);
   }
   printf("]\n");
}
void main() {
   printf("Input Array: ");
   display();
   printline(50);
   //find location of 1
   int location = find(55);
   // if element was found 
   if(location != -1)
      printf("\nElement found at location: %d" ,(location+1));
   else
      printf("Element not found.");
}

如果我们编译并运行上面的程序，它将产生以下结果 -

输出 (Output)

Input Array: [1 2 3 4 6 7 9 11 12 14 15 16 17 19 33 34 43 45 55 66 ]
==================================================
Total comparisons made: 19
Element found at location: 19