使用 C 的 DSA - 线性搜索

概述

线性搜索是一种非常简单的搜索算法。在这种类型的搜索中，会逐个对所有项目进行顺序搜索。检查每个项目，如果找到匹配项，则返回该特定项目，否则搜索将继续，直到数据收集结束。

算法

Linear Search ( A: array of item, n: total no. of items ,x: item to be searched)
Step 1: Set i to 1
Step 2: if i > n then go to step 7
Step 3: if A[i] = x then go to step 6
Step 4: Set i to i + 1
Step 5: Go to Step 2
Step 6: Print Element x Found at index i and go to step 8
Step 7: Print element not found
Step 8: Exit

示例

#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("=
");
}
// 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("]
");
}
main(){
   printf("Input Array: ");
   display();
   printline(50);
   
   //find location of 1
   int location = find(55);

   // if element was found 
   if(location != -1)
      printf("
Element found at location: %d" ,(location+1));
   else
      printf("Element not found.");
}

输出

如果我们编译并运行上述程序，则会产生以下输出 −

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

dsa_using_c_search_techniques.html