c语言线性结构实例详解,线性搜索实例程序（C语言）

线性搜索实例程序，使用 C语言实现如下所示：

#include

#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

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

// 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

printf("%d ",intArray[i]);

}

printf("]\n");

}

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

¥ 我要打赏

纠错/补充

收藏

加QQ群啦，易百教程官方技术学习群

注意：建议每个人选自己的技术方向加群，同一个QQ最多限加 3 个群。