#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.);
}
版权声明:本文内容由互联网用户自发贡献,该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 dio@foxmail.com 举报,一经查实,本站将立刻删除。