/* This program will demonstrate the use of Linear Search */

#include<stdio.h>
#define size 10
int linear(int [], int, int);

int main() {
// int x[size] = {5,6,7,8,9,0,1,5,3,4}; //unsorted
int x[size] = {1,2,3,4,5,6,7,8,9,10}; //sorted
int i, pos;
int key;

printf("List : ");
for(i=0; i < size; i++)
printf("%i ", x[i]);

printf("\nEnter key value to find: ");

scanf("%i", &key);
//actual searching
pos = linear(x,size,key);

if (pos == -1)
printf("Key value not found!\n");
else
printf("Key value found at position %i\n", pos+1);

int linear(int x[], int n, int key) {

int i, pos;
for(i=0; i<n; i++) {
if (key == x[i]) {
pos = i;
break;
}
else
pos = -1;
}

return pos;
}