Notes

#include<stdio.h>
#include<stdlib.h>
#include<time.h>
void linear(int arr[],int n,int key)
{
for(int i=0;i<n;i++)
{
if(arr[i]==key)
{
printf("the key is at index %dn",i);
return;
}
}
printf("the key is not presentn");
return;
}
void binary(int arr[],int l,int h,int key)
{
if(l==h)
{
if(key==arr[l])
printf("the key is at index %dn",l);
else
printf("the key is not presentn ");
return;
}
else
{
int mid=(l+h)/2;
if(arr[mid]==key)
{
printf("the key is at index %dn",mid);
return;
}
else if(arr[mid]<key)
binary(arr,l,mid-1,key);
else
binary(arr,mid+1,h,key);
}
}
int main()
{
printf("enter no of elements in the arrayn");
int n,i,s=1,key;
scanf("%d",&n);
int arr[n],a[n];
double time_exel,time_exeb,T;
clock_t start, end;
for(i=0;i<n;i++)
{
arr[i]=s+((rand()%(50000-s)+1));
a[i]=arr[i];
}
printf("The array is createdn");
key=s+((rand()%(50000-s)+1));
printf("The element to be searched is:%dn",key);
//linear search
start= clock();
linear(arr,n,key);
end=clock();
time_exel=end-start;
T=time_exel/CLOCKS_PER_SEC;
printf("total execution time for linear search is: %If and time taken by CPU is %Ifn",time_exel,T);
//binary search
start= clock();
binary(a,0,n-1,key);
end=clock();
time_exeb=end-start;
T=time_exeb/CLOCKS_PER_SEC;
printf("total execution time for binary search is: %If and time taken by CPU is %Ifn",time_exeb,T);
return 0;
}