Linear/ Sequential Searching Data Structure Example in C - C program to find an element using Linear/Sequential Searching from an Array.

Linear or Sequential searching algorithm is used to find the item in a list, This algorithm consist the checking every item in the list until the desired (required) item is found.
This searching algorithm is very simple to use and understand.

Linear/Sequential Searching Implementation using C program


/*
	program to implement Linear Searching,
	to find an element in array.
*/

#include <stdio.h>

#define MAX 5

/** 	function	:	linearSearch()
	to search an element.
**/
int linearSearch(int *a,int n)
{
	int i,pos=-1;

	for(i=0;i< MAX; i++)
	{
		if(a[i]==n)
		{
			pos=i;
			break;
		}
	}
	return pos;
}

int main()
{
	int i,n,arr[MAX];
	int num;     /* element to search*/
	int position;

	printf("\nEnter array elements:\n");
	for(i=0;i< MAX;i++)
		scanf("%d",&arr[i]);

	printf("\nNow enter element to search :");
	scanf("%d",&num);

	/* calling linearSearch function*/

	position=linearSearch(arr,num);

	if(num==-1)
		printf("Element not found.\n");
	else
		printf("Element found @ %d position.\n",position);

	return 0;
}

    Enter array elements:
    10
    20
    15
    30
    40

    Now enter element to search :15
    Element found @ 2 position.