LAB FILE

OF
ALGORITHMS DESIGN AND ANALYSIS

(ETCS-301)

NORTHERN INDIA ENGINEERING COLLEGE,

NEW DELHI

SUBMITTED TO SUBMITTED BY

Mrs. Jyoti Verma Sanchit Aggarwal

Assistant Professor 05415603115
IT (T-9)
 INDEX

S.NO. NAME OF THE EXPERIMENT DATE T. SIGN MARKS

 Experiment No. 1

Aim: Write a program to implement linear search and analyse its complexity.

Code:
#include<stdio.h>
#include<conio.h>
void main()
{
int a[10],b,i,n;
void lrsrch(int,int*,int);
clrscr();
printf("Enter No of elements\n");
scanf("%d",&n);
printf("Enter %d elements\n",n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
printf("Enter element to be searched for\n");
scanf("%d",&b);
lrsrch(b,a,n);
getch();
}
void lrsrch(int x,int *p,int n)
{
int i;
for(i=0;i<n;i++)
{
if(p[i]==x)
{
printf("\nElement %d found at index %d\n",x,i);
printf("\nNo of iterations Performed=%d",i+1);
return ;
}
}
printf("\nElement Not Found!!\n");
printf("\nNo of iterations Performed=%d",i+1);
}
Output