Flowchart for linear search

Answer 1

PROGRAM:

//LINEAR SEARCH USING FUNCTIONS

#include

void linear(int [],int,int);

main()

{

int n,i,x,a[10];

printf("\nEnter the limit:");

scanf("%d",&n);

printf("\nEnter the elements:");

for(i=0;i

{

scanf("%d",&a[i]);

}

printf("\nEnter the element to be searched:");

scanf("%d",&x);

linear(a,n,x);

}

void linear(int a[],int n,int x)

{

int i,flag=0;

for(i=0;i

{

if(x==a[i])

{

flag=1;

break;

}

}

if(flag==1)

printf("\nElement %d is in the position %d",a[i],i+1);

else

printf("\nElement is not in the list");

}