线性搜索是一种非常简单的搜索算法,在这种类型的搜索中,对所有元素进行逐个搜索。检查每个元素,如果找到匹配项,则返回该特定项目,否则搜索将继续到数据收集结束。
procedure linear_search (list, value) for each item in the list if match item == value return 返回值 end if end for end procedure
#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."); }
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
祝学习愉快!(内容编辑有误?请选中要编辑内容 -> 右键 -> 修改 -> 提交!)